| 2026 | STOC | Ideals, Macaulay Bases, and PCPs. | Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan, Sophus Valentin Willumsgaard |
| 2026 | STOC | Negations Are Powerful Even in Small Depth. | Bruno Cavalar, Tho Borm Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, Amir Yehudayoff |
| 2025 | ICALP | A Near-Optimal Polynomial Distance Lemma over Boolean Slices. | Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan |
| 2025 | ICALP | New Bounds for the Ideal Proof System in Positive Characteristic. | Amik Raj Behera, Nutan Limaye, Varun Ramanathan, Srikanth Srinivasan |
| 2025 | MFCS | #SAT-Algorithms for Classes of Threshold Circuits Based on Probabilistic Rank. | Nutan Limaye, Adarsh Srinivasan, Srikanth Srinivasan |
| 2025 | SODA | Low Degree Local Correction Over the Boolean Cube. | Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan |
| 2024 | STOC | Local Correction of Linear Functions over the Boolean Cube. | Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan |
| 2024 | STOC | On the Power of Homogeneous Algebraic Formulas. | Herv Fournier, Nutan Limaye, Srikanth Srinivasan, Sbastien Tavenas |
| 2023 | STOC | Optimal Explicit Small-Depth Formulas for the Coin Problem. | Srikanth Srinivasan, Utkarsh Tripathi |
| 2022 | STOC | Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication. | Sbastien Tavenas, Nutan Limaye, Srikanth Srinivasan |
| 2021 | FOCS | Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. | Nutan Limaye, Srikanth Srinivasan, Sbastien Tavenas |
| 2020 | STOC | A robust version of Hegedus's lemma, with applications. | Srikanth Srinivasan |
| 2019 | ISCAS | Noise Immune, Low-Skew, Pulse Width Retainable Analog Glitch-Filter. | Jhankar Malakar, Devraj M. Rajagopal, Srikanth Srinivasan, Gayatri Hegde |
| 2019 | STOC | A fixed-depth size-hierarchy theorem for AC | Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh |
| 2018 | FOCS | A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. | Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan |
| 2018 | ICALP | A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas. | Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan |
| 2018 | MFCS | Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. | Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan |
| 2018 | STACS | Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. | Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan |
| 2017 | ICALP | Separation of AC^0[oplus] Formulas and Circuits. | Benjamin Rossman, Srikanth Srinivasan |
| 2017 | MFCS | Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees. | Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan |
| 2017 | STACS | On Polynomial Approximations Over Z/2^kZ*. | Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan |
| 2015 | MFCS | The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. | Herv Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan |
| 2015 | STACS | Derandomized Graph Product Results Using the Low Degree Long Code. | Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma |
| 2014 | FOCS | An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. | Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan |
| 2014 | STOC | Lower bounds for depth 4 formulas computing iterated matrix multiplication. | Herv Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan |
| 2014 | STOC | Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. | Venkatesan Guruswami, Prahladh Harsha, Johan Hstad, Srikanth Srinivasan, Girish Varma |
| 2014 | STOC | Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas. | Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan |
| 2012 | ICALP | On the Limits of Sparsification. | Rahul Santhanam, Srikanth Srinivasan |
| 2011 | MFCS | Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions. | Andreas Krebs, Nutan Limaye, Srikanth Srinivasan |
| 2011 | STOC | Almost settling the hardness of noncommutative determinant. | Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan |
| 2010 | STOC | On the hardness of the noncommutative determinant. | Vikraman Arvind, Srikanth Srinivasan |
| 2010 | STACS | The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets. | Vikraman Arvind, Srikanth Srinivasan |
| 2009 | ISAAC | On Lower Bounds for Constant Width Arithmetic Circuits. | Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan |
| 2000 | VLSID | CREAM: Combined Register and Module Assignment with Floorplanning for Low Power Datapath Synthesis. | Vamsi K. Srikantam, N. Ranganathan, Srikanth Srinivasan |