Balagopal Komarath

39 papers A* 2A 4B 2Misc 1Journal 26Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Finding and counting patterns in sparse graphs.
J. Comput. Syst. Sci.
Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia
2025 J jnl
Counting Patterns in Degenerate Graphs in Constant Space.
CoRR
Balagopal Komarath, Anant Kumar, Akash Pareek
2025 J jnl
Hazard-free Decision Trees.
CoRR
Deepu Benson, Balagopal Komarath, Jayalal Sarma, Nalli Sai Soumya
2025 J jnl
Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials.
CoRR
Balagopal Komarath, Rohit Narayanan
2025 B conf
Sensitivity and Query Complexity Under Uncertainty.
MFCS
Deepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah
2025 J jnl
Sensitivity and Query Complexity under Uncertainty.
CoRR
Deepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah
2024 A conf
On the Power of Border Width-2 ABPs over Fields of Characteristic 2.
STACS
Pranjal Dutta, Christian Ikenmeyer, Balagopal Komarath, Harshil Mittal, Saraswati Girish Nanoti, Dhara Thakkar
2023 A conf
Finding and Counting Patterns in Sparse Graphs.
STACS
Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia
2023 J jnl
Finding and Counting Patterns in Sparse Graphs.
CoRR
Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia
2023 A conf
Karchmer-Wigderson Games for Hazard-Free Computation.
ITCS
Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh
2023 J jnl
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials.
Algorithmica
Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul
2022 A* conf
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials.
ICALP
Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul
2022 B conf
Rabbits Approximate, Cows Compute Exactly!
MFCS
Balagopal Komarath, Anurag Pandey, Nitin Saurabh
2021 J jnl
Karchmer-Wigderson Games for Hazard-free Computation.
CoRR
Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh
2021 J jnl
Karchmer-Wigderson Games for Hazard-free Computation.
Electron. Colloquium Comput. Complex.
Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh
2020 J jnl
Graph Homomorphism Polynomials: Algorithms and Complexity.
CoRR
Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul
2020 J jnl
On the complexity of detecting hazards.
CoRR
Balagopal Komarath, Nitin Saurabh
2020 J jnl
On the complexity of detecting hazards.
Inf. Process. Lett.
Balagopal Komarath, Nitin Saurabh
2019 J jnl
On the Complexity of Hazard-free Circuits.
J. ACM
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
2018 J jnl
Comparator Circuits over Finite Bounded Posets.
Inf. Comput.
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
2018 — conf
Graph Pattern Polynomials.
FSTTCS
Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah
2018 J jnl
Graph Pattern Polynomials.
CoRR
Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah
2018 A* conf
On the complexity of hazard-free circuits.
STOC
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
2018 J jnl
Pebbling meets coloring: Reversible pebble game on trees.
J. Comput. Syst. Sci.
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
2017 J jnl
On the Complexity of L-reachability.
CoRR
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
2017 J jnl
On the complexity of hazard-free circuits.
CoRR
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
2016 J jnl
On the Complexity of L-reachability.
Fundam. Informaticae
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
2016 J jnl
Pebbling Meets Coloring : Reversible Pebble Game On Trees.
Electron. Colloquium Comput. Complex.
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
2016 J jnl
Pebbling Meets Coloring: Reversible Pebble Game On Trees.
CoRR
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
2015 — conf
Comparator Circuits over Finite Bounded Posets.
ICALP (1)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
2015 J jnl
Comparator Circuits over Finite Bounded Posets.
CoRR
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
2015 J jnl
Comparator Circuits over Finite Bounded Posets.
Electron. Colloquium Comput. Complex.
K. S. Sunil, Balagopal Komarath, Jayalal Sarma
2015 J jnl
Pebbling, Entropy, and Branching Program Size Lower Bounds.
ACM Trans. Comput. Theory
Balagopal Komarath, Jayalal Sarma
2015 Misc conf
Reversible Pebble Game on Trees.
COCOON
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
2014 — conf
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth.
MFCS (2)
Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard
2014 — conf
On the Complexity of L-reachability.
DCFS
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
2013 J jnl
Pebbling, Entropy and Branching Program Size Lower Bounds
CoRR
Balagopal Komarath, Jayalal Sarma
2013 A conf
Pebbling, Entropy and Branching Program Size Lower Bounds.
STACS
Balagopal Komarath, Jayalal Sarma
2013 J jnl
Pebbling, Entropy and Branching Program Size Lower Bounds.
Electron. Colloquium Comput. Complex.
Balagopal Komarath, Jayalal Sarma