| 2026 | ICALP | VP, VNP and Algebraic Branching Programs over Min-Plus Semirings. | Balagopal Komarath, Harshil Mittal, Jayalal Sarma |
| 2026 | MFCS | On CC⁰ Lower Bounds for AND via Torus Polynomials. | Vaibhav Krishan, Jayalal Sarma |
| 2025 | CIAC | Almost-Catalytic Computation. | Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Rai, Jayalal Sarma |
| 2025 | FCT | Shallow-Rotation Distance via Forest Representations. | S. K. M. Anoop, Jayalal Sarma |
| 2025 | FCT | On Saving Energy in Boolean Circuits via Negations. | Jayalal Sarma, Kei Uchizawa |
| 2025 | MFCS | Sensitivity and Query Complexity Under Uncertainty. | Deepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah |
| 2024 | TAMC | Energy and Output Patterns in Boolean Circuits. | Jayalal Sarma, Kei Uchizawa |
| 2022 | COCOON | Rotation Distance for Rank Bounded Trees. | S. K. M. Anoop, Jayalal Sarma |
| 2021 | LATA | On the Computational Power of Programs over BA | Manasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan |
| 2020 | COCOON | Power of Decision Trees with Monotone Queries. | Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma |
| 2020 | COCOON | On the Mystery of Negations in Circuits: Structure vs Power. | Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma |
| 2020 | TAMC | On Pure Space vs Catalytic Space. | Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma |
| 2019 | COCOON | Sensitivity, Affine Transforms and Quantum Communication Complexity. | Krishnamoorthy Dinesh, Jayalal Sarma |
| 2018 | COCOON | New Bounds for Energy Complexity of Boolean Functions. | Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma |
| 2017 | FCT | Testing Polynomial Equivalence by Scaling Matrices. | Markus Blser, B. V. Raghavendra Rao, Jayalal Sarma |
| 2017 | LATA | Space Complexity of Reachability Testing in Labelled Graphs. | Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil |
| 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 | COCOON | Depth Lower Bounds against Circuits with Sparse Orientation. | Sajin Koroth, Jayalal Sarma |
| 2014 | MFCS | Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. | Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard |
| 2013 | ICALP | Arithmetic Circuit Lower Bounds via MaxRank. | Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma |
| 2013 | STACS | Pebbling, Entropy and Branching Program Size Lower Bounds. | Balagopal Komarath, Jayalal Sarma |
| 2013 | WALCOM | On Directed Tree Realizations of Degree Sets. | Prasun Kumar, Jayalal Sarma, Saurabh Sawlani |
| 2011 | STACS | On Isomorphism Testing of Groups with Normal Hall Subgroups. | Youming Qiao, Jayalal Sarma, Bangsheng Tang |
| 2010 | CSR | Balancing Bounded Treewidth Circuits. | Maurice J. Jansen, Jayalal Sarma |
| 2010 | MFCS | Limiting Negations in Bounded Treewidth and Upward Planar Circuits. | Jing He, Hongyu Liang, Jayalal Sarma |
| 2009 | CSR | On the Complexity of Matroid Isomorphism Problems. | B. V. Raghavendra Rao, Jayalal Sarma |
| 2007 | CSR | On the Complexity of Matrix Rank and Rigidity. | Meena Mahajan, Jayalal Sarma |
| 2006 | STACS | Evaluating Monotone Circuits on Cylinders, Planes and Tori. | Nutan Limaye, Meena Mahajan, Jayalal Sarma |