default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalagopal Komarath
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Pranjal Dutta, Christian Ikenmeyer, Balagopal Komarath, Harshil Mittal, Saraswati Girish Nanoti, Dhara Thakkar:
On the Power of Border Width-2 ABPs over Fields of Characteristic 2. STACS 2024: 31:1-31:16- 2023
- [j7]Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul:
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. Algorithmica 85(9): 2554-2579 (2023) - [c11]Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh:
Karchmer-Wigderson Games for Hazard-Free Computation. ITCS 2023: 74:1-74:25 - [c10]Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia
:
Finding and Counting Patterns in Sparse Graphs. STACS 2023: 40:1-40:20 - [i14]Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia:
Finding and Counting Patterns in Sparse Graphs. CoRR abs/2301.02569 (2023) - 2022
- [c9]Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul:
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. ICALP 2022: 83:1-83:20 - [c8]Balagopal Komarath, Anurag Pandey, Nitin Saurabh:
Rabbits Approximate, Cows Compute Exactly! MFCS 2022: 65:1-65:14 - 2021
- [i13]Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh:
Karchmer-Wigderson Games for Hazard-free Computation. CoRR abs/2107.05128 (2021) - [i12]Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh:
Karchmer-Wigderson Games for Hazard-free Computation. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j6]Balagopal Komarath, Nitin Saurabh:
On the complexity of detecting hazards. Inf. Process. Lett. 162: 105980 (2020) - [i11]Balagopal Komarath, Nitin Saurabh:
On the complexity of detecting hazards. CoRR abs/2006.10592 (2020) - [i10]Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul:
Graph Homomorphism Polynomials: Algorithms and Complexity. CoRR abs/2011.04778 (2020)
2010 – 2019
- 2019
- [j5]Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah:
On the Complexity of Hazard-free Circuits. J. ACM 66(4): 25:1-25:20 (2019) - 2018
- [j4]Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
Comparator Circuits over Finite Bounded Posets. Inf. Comput. 261: 160-174 (2018) - [j3]Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani:
Pebbling meets coloring: Reversible pebble game on trees. J. Comput. Syst. Sci. 91: 33-41 (2018) - [c7]Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah:
Graph Pattern Polynomials. FSTTCS 2018: 18:1-18:13 - [c6]Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah:
On the complexity of hazard-free circuits. STOC 2018: 878-889 - [i9]Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah:
Graph Pattern Polynomials. CoRR abs/1809.08858 (2018) - 2017
- [i8]Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
On the Complexity of L-reachability. CoRR abs/1701.03255 (2017) - [i7]Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah:
On the complexity of hazard-free circuits. CoRR abs/1711.01904 (2017) - 2016
- [j2]Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
On the Complexity of L-reachability. Fundam. Informaticae 145(4): 471-483 (2016) - [i6]Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani:
Pebbling Meets Coloring: Reversible Pebble Game On Trees. CoRR abs/1604.05510 (2016) - [i5]Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani:
Pebbling Meets Coloring : Reversible Pebble Game On Trees. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j1]Balagopal Komarath, Jayalal Sarma:
Pebbling, Entropy, and Branching Program Size Lower Bounds. ACM Trans. Comput. Theory 7(2): 8:1-8:21 (2015) - [c5]Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani:
Reversible Pebble Game on Trees. COCOON 2015: 83-94 - [c4]Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
Comparator Circuits over Finite Bounded Posets. ICALP (1) 2015: 834-845 - [i4]Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
Comparator Circuits over Finite Bounded Posets. CoRR abs/1503.00275 (2015) - [i3]K. S. Sunil, Balagopal Komarath, Jayalal Sarma:
Comparator Circuits over Finite Bounded Posets. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c3]Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
On the Complexity of L-reachability. DCFS 2014: 258-269 - [c2]Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard:
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. MFCS (2) 2014: 336-347 - 2013
- [c1]Balagopal Komarath, Jayalal Sarma:
Pebbling, Entropy and Branching Program Size Lower Bounds. STACS 2013: 622-633 - [i2]Balagopal Komarath, Jayalal Sarma:
Pebbling, Entropy and Branching Program Size Lower Bounds. CoRR abs/1301.1425 (2013) - [i1]Balagopal Komarath, Jayalal Sarma:
Pebbling, Entropy and Branching Program Size Lower Bounds. Electron. Colloquium Comput. Complex. TR13 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
