Verifying Proofs in Constant Depth. - Olaf Beyersdorff; Samir Datta; Meena Mahajan; Gido Scharfenberger-Fabian; Karteek Sreenivasaiah; Michael Thomas 001; Heribert Vollmer (MFCS, 2011)

Counting paths in planar width 2 branching programs. - Meena Mahajan; Nitin Saurabh; Karteek Sreenivasaiah (CATS, 2012)

The Complexity of Unary Subset Sum. - Nutan Limaye; Meena Mahajan; Karteek Sreenivasaiah (COCOON, 2012)

Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs. - Meena Mahajan; B. V. Raghavendra Rao; Karteek Sreenivasaiah (MFCS, 2012)

Verifying Proofs in Constant Depth. - Olaf Beyersdorff; Samir Datta; Andreas Krebs; Meena Mahajan; Gido Scharfenberger-Fabian; Karteek Sreenivasaiah; Michael Thomas 001; Heribert Vollmer (Electron. Colloquium Comput. Complex., 2012)

Small Depth Proof Systems. - Andreas Krebs; Nutan Limaye; Meena Mahajan; Karteek Sreenivasaiah (Electron. Colloquium Comput. Complex., 2013)

Space-Efficient Approximations for Subset Sum. - Anna Gál; Jing-Tang Jang; Nutan Limaye; Meena Mahajan; Karteek Sreenivasaiah (Electron. Colloquium Comput. Complex., 2014)

Monomials, multilinearity and identity testing in simple read-restricted circuits. - Meena Mahajan; B. V. Raghavendra Rao; Karteek Sreenivasaiah (Theor. Comput. Sci., 2014)

Building above read-once polynomials: identity testing and hardness of representation. - Meena Mahajan; B. V. Raghavendra Rao; Karteek Sreenivasaiah (Electron. Colloquium Comput. Complex., 2015)

Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials. - Christian Engels; B. V. Raghavendra Rao; Karteek Sreenivasaiah (Electron. Colloquium Comput. Complex., 2016)

On varSigma wedge varSigma wedge varSigma Circuits: The Role of Middle varSigma Fan-In, Homogeneity and Bottom Degree. - Christian Engels; B. V. Raghavendra Rao; Karteek Sreenivasaiah (FCT, 2017)

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

The Coin Problem in Constant Depth: Sample Complexity and Parity gates. - Nutan Limaye; Karteek Sreenivasaiah; Srikanth Srinivasan 001; Utkarsh Tripathi; S. Venkitesh (Electron. Colloquium Comput. Complex., 2018)

A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem. - Nutan Limaye; Karteek Sreenivasaiah; Srikanth Srinivasan 001; Utkarsh Tripathi; S. Venkitesh (STOC, 2019)

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

A game characterisation of tree-like Q-Resolution size. - Olaf Beyersdorff; Leroy Chew; Karteek Sreenivasaiah (J. Comput. Syst. Sci., 2019)

A Fixed-Depth Size-Hierarchy Theorem for $ mathrm{AC}^0[ oplus]$ via the Coin Problem. - Nutan Limaye; Karteek Sreenivasaiah; Srikanth Srinivasan 001; Utkarsh Tripathi; S. Venkitesh (SIAM J. Comput., 2021)

Depth-3 Circuit Lower Bounds for k-OV. - Tameem Choudhury; Karteek Sreenivasaiah (Electron. Colloquium Comput. Complex., 2023)

Query Complexity with Unknowns. - Nikhil S. Mande; Karteek Sreenivasaiah (CoRR, 2024)

Linear threshold functions in decision lists, decision trees, and depth-2 circuits. - Yogesh Dahiya; K. Vignesh; Meena Mahajan; Karteek Sreenivasaiah (Inf. Process. Lett., 2024)

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