Balagopal Komarath
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
13
Venues
5
Active years
2013–2026
Best venue rank
A*
Where they publish
Papers
13 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | VP, VNP and Algebraic Branching Programs over Min-Plus Semirings. | Balagopal Komarath, Harshil Mittal, Jayalal Sarma |
| 2026 | MFCS | Counting Patterns in Degenerate Graphs in Constant Space. | Balagopal Komarath, Anant Kumar, Akash Pareek |
| 2026 | MFCS | Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials. | Balagopal Komarath, Rohit Narayanan |
| 2025 | MFCS | Sensitivity and Query Complexity Under Uncertainty. | Deepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah |
| 2024 | STACS | 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 |
| 2023 | STACS | Finding and Counting Patterns in Sparse Graphs. | Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia |
| 2022 | ICALP | Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. | Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul |
| 2022 | MFCS | Rabbits Approximate, Cows Compute Exactly! | Balagopal Komarath, Anurag Pandey, Nitin Saurabh |
| 2018 | STOC | On the complexity of hazard-free circuits. | Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah |
| 2015 | COCOON | Reversible Pebble Game on Trees. | Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani |
| 2015 | ICALP | Comparator Circuits over Finite Bounded Posets. | Balagopal Komarath, Jayalal Sarma, K. S. Sunil |
| 2014 | MFCS | Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. | Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard |
| 2013 | STACS | Pebbling, Entropy and Branching Program Size Lower Bounds. | Balagopal Komarath, Jayalal Sarma |