Pebbling, Entropy and Branching Program Size Lower Bounds. - Balagopal Komarath; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2013)

Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. - Kristoffer Arnsfelt Hansen; Balagopal Komarath; Jayalal Sarma; Sven Skyum; Navid Talebanfard (MFCS (2), 2014)

Reversible Pebble Game on Trees. - Balagopal Komarath; Jayalal Sarma; Saurabh Sawlani (COCOON, 2015)

Comparator Circuits over Finite Bounded Posets. - K. S. Sunil; Balagopal Komarath; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2015)

On the Complexity of L-reachability. - Balagopal Komarath; Jayalal Sarma; K. S. Sunil (Fundam. Informaticae, 2016)

Graph Pattern Polynomials. - Markus Bläser; Balagopal Komarath; Karteek Sreenivasaiah (FSTTCS, 2018)

Pebbling meets coloring: Reversible pebble game on trees. - Balagopal Komarath; Jayalal Sarma; Saurabh Sawlani (J. Comput. Syst. Sci., 2018)

On the Complexity of Hazard-free Circuits. - Christian Ikenmeyer; Balagopal Komarath; Christoph Lenzen 001; Vladimir Lysikov; Andrey Mokhov; Karteek Sreenivasaiah (J. ACM, 2019)

Graph Homomorphism Polynomials: Algorithms and Complexity. - Balagopal Komarath; Anurag Pandey 001; Chengot Sankaramenon Rahul (CoRR, 2020)

On the complexity of detecting hazards. - Balagopal Komarath; Nitin Saurabh (Inf. Process. Lett., 2020)

Karchmer-Wigderson Games for Hazard-free Computation. - Christian Ikenmeyer; Balagopal Komarath; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2021)

Rabbits Approximate, Cows Compute Exactly! - Balagopal Komarath; Anurag Pandey 001; Nitin Saurabh (MFCS, 2022)

Finding and Counting Patterns in Sparse Graphs. - Balagopal Komarath; Anant Kumar; Suchismita Mishra 001; Aditi Sethia (STACS, 2023)

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. - Balagopal Komarath; Anurag Pandey 001; Chengot Sankaramenon Rahul (Algorithmica, 2023)

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 (STACS, 2024)

Sensitivity and Query Complexity Under Uncertainty. - Deepu Benson; Balagopal Komarath; Nikhil S. Mande; Nalli Sai Soumya; Jayalal Sarma; Karteek Sreenivasaiah (MFCS, 2025)

Hazard-free Decision Trees. - Deepu Benson; Balagopal Komarath; Jayalal Sarma; Nalli Sai Soumya (CoRR, 2025)