Balagopal Komarath

According to our database, Balagopal Komarath authored at least 15 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

On the Power of Border Width-2 ABPs over Fields of Characteristic 2.

Pranjal Dutta, Christian Ikenmeyer, Balagopal Komarath, Harshil Mittal, Saraswati Girish Nanoti, Dhara Thakkar

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials.

Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul

Algorithmica, September, 2023

Finding and Counting Patterns in Sparse Graphs.

Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Rabbits Approximate, Cows Compute Exactly!

Balagopal Komarath, Anurag Pandey, Nitin Saurabh

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Karchmer-Wigderson Games for Hazard-free Computation.

Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh

Electron. Colloquium Comput. Complex., 2021

2020

On the complexity of detecting hazards.

Balagopal Komarath, Nitin Saurabh

Inf. Process. Lett., 2020

Graph Homomorphism Polynomials: Algorithms and Complexity.

Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul

CoRR, 2020

2019

On the Complexity of Hazard-free Circuits.

Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah

J. ACM, 2019

2018

Pebbling meets coloring: Reversible pebble game on trees.

Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani

J. Comput. Syst. Sci., 2018

Graph Pattern Polynomials.

Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2016

On the Complexity of L-reachability.

Balagopal Komarath, Jayalal Sarma, K. S. Sunil

Fundam. Informaticae, 2016

2015

Comparator Circuits over Finite Bounded Posets.

K. S. Sunil, Balagopal Komarath, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2015

Reversible Pebble Game on Trees.

Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth.

Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Pebbling, Entropy and Branching Program Size Lower Bounds.

Balagopal Komarath, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2013