Balagopal Komarath

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 28

Top Topics

Clause Learning

Frequent Closed

Surprising Patterns

Top Venues

Electron. Colloquium Comput. Complex.

J. Comput. Syst. Sci.

Publications

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)
Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh
Karchmer-Wigderson Games for Hazard-Free Computation. ITCS (2023)
Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia
Finding and Counting Patterns in Sparse Graphs. CoRR (2023)
Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. Algorithmica 85 (9) (2023)
Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia
Finding and Counting Patterns in Sparse Graphs. STACS (2023)
Balagopal Komarath, Anurag Pandey, Nitin Saurabh
Rabbits Approximate, Cows Compute Exactly! MFCS (2022)
Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. ICALP (2022)
Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh
Karchmer-Wigderson Games for Hazard-free Computation. Electron. Colloquium Comput. Complex. 28 (2021)
Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh
Karchmer-Wigderson Games for Hazard-free Computation. CoRR (2021)
Balagopal Komarath, Nitin Saurabh
On the complexity of detecting hazards. CoRR (2020)
Balagopal Komarath, Nitin Saurabh
On the complexity of detecting hazards. Inf. Process. Lett. 162 (2020)
Balagopal Komarath, Anurag Pandey, C. S. Rahul
Graph Homomorphism Polynomials: Algorithms and Complexity. CoRR (2020)
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
On the Complexity of Hazard-free Circuits. J. ACM 66 (4) (2019)
Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah
Graph Pattern Polynomials. FSTTCS (2018)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
Comparator Circuits over Finite Bounded Posets. Inf. Comput. 261 (2018)
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
Pebbling meets coloring: Reversible pebble game on trees. J. Comput. Syst. Sci. 91 (2018)
Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah
Graph Pattern Polynomials. CoRR (2018)
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
On the complexity of hazard-free circuits. STOC (2018)
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
On the complexity of hazard-free circuits. CoRR (2017)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
On the Complexity of L-reachability. CoRR (2017)
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
Pebbling Meets Coloring: Reversible Pebble Game On Trees. CoRR (2016)
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
Pebbling Meets Coloring : Reversible Pebble Game On Trees. Electron. Colloquium Comput. Complex. 23 (2016)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
On the Complexity of L-reachability. Fundam. Informaticae 145 (4) (2016)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
Comparator Circuits over Finite Bounded Posets. ICALP (1) (2015)
Balagopal Komarath, Jayalal Sarma
Pebbling, Entropy, and Branching Program Size Lower Bounds. ACM Trans. Comput. Theory 7 (2) (2015)
K. S. Sunil, Balagopal Komarath, Jayalal Sarma
Comparator Circuits over Finite Bounded Posets. Electron. Colloquium Comput. Complex. 22 (2015)
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
Reversible Pebble Game on Trees. COCOON (2015)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
Comparator Circuits over Finite Bounded Posets. CoRR (2015)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
On the Complexity of L-reachability. DCFS (2014)
Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. MFCS (2) (2014)
Balagopal Komarath, Jayalal Sarma
Pebbling, Entropy and Branching Program Size Lower Bounds. Electron. Colloquium Comput. Complex. 20 (2013)
Balagopal Komarath, Jayalal Sarma
Pebbling, Entropy and Branching Program Size Lower Bounds. STACS (2013)
Balagopal Komarath, Jayalal Sarma
Pebbling, Entropy and Branching Program Size Lower Bounds CoRR (2013)