Evaluating Monotone Circuits on Cylinders, Planes and Tori - Nutan Limaye; Meena Mahajan; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2006)

Arithmetizing Classes Around NC 1 and L. - Nutan Limaye; Meena Mahajan; B. V. Raghavendra Rao (STACS, 2007)

Arithmetizing classes around NC^1 and L. - Nutan Limaye; Meena Mahajan; B. V. Raghavendra Rao (Electron. Colloquium Comput. Complex., 2007)

3-connected Planar Graph Isomorphism is in Log-space. - Samir Datta; Nutan Limaye; Prajakta Nimbhorkar (FSTTCS, 2008)

A Log-space Algorithm for Canonization of Planar Graphs - Samir Datta; Nutan Limaye; Prajakta Nimbhorkar; Thomas Thierauf; Fabian Wagner (CoRR, 2008)

Longest Paths in Planar DAGs in Unambiguous Logspace. - Nutan Limaye; Meena Mahajan; Prajakta Nimbhorkar (CATS, 2009)

Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata. - Nutan Limaye; Meena Mahajan (LATA, 2009)

Upper Bounds for Monotone Planar Circuit Value and Variants. - Nutan Limaye; Meena Mahajan; Jayalal Sarma (Comput. Complex., 2009)

Planar Graph Isomorphism is in Log-space. - Fabian Wagner; Samir Datta; Nutan Limaye; Prajakta Nimbhorkar; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2009)

On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. - Nutan Limaye; Meena Mahajan; Antoine Meyer (J. Autom. Lang. Comb., 2009)

Longest Paths in Planar DAGs in Unambiguous Log-Space. - Nutan Limaye; Meena Mahajan; Prajakta Nimbhorkar (Chic. J. Theor. Comput. Sci., 2010)

Streaming algorithms for some problems in log-space. - Ajesh Babu; Nutan Limaye; Girish Varma (Electron. Colloquium Comput. Complex., 2010)

Counting paths in VPA is complete for #NC1. - Andreas Krebs; Nutan Limaye; Meena Mahajan (Electron. Colloquium Comput. Complex., 2010)

Arithmetizing Classes Around NC textsf{NC}1 and L textsf{L}. - Nutan Limaye; Meena Mahajan; B. V. Raghavendra Rao (Theory Comput. Syst., 2010)

Planarity, Determinants, Permanents, and (Unique) Matchings. - Samir Datta; Raghav Kulkarni; Nutan Limaye; Meena Mahajan (ACM Trans. Comput. Theory, 2010)

Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions. - Andreas Krebs; Nutan Limaye; Srikanth Srinivasan 001 (MFCS, 2011)

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

Counting Paths in VPA Is Complete for #NC 1. - Andreas Krebs; Nutan Limaye; Meena Mahajan (Algorithmica, 2012)

In-Network Estimation of Frequency Moments - Pooja Vyavahare; Nutan Limaye; D. Manjunath (CoRR, 2012)

DLOGTIME-Proof Systems. - Andreas Krebs; Nutan Limaye (Electron. Colloquium Comput. Complex., 2012)

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

Streaming algorithms for language recognition problems. - Ajesh Babu; Nutan Limaye; Jaikumar Radhakrishnan; Girish Varma (Theor. Comput. Sci., 2013)

Information friction limits on computation. - Pooja Vyavahare; Majid Mahzoon; Pulkit Grover; Nutan Limaye; D. Manjunath (Allerton, 2014)

Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas. - Neeraj Kayal; Nutan Limaye; Chandan Saha 001; Srikanth Srinivasan 001 (STOC, 2014)

Efficient Embedding of Functions in Weighted Communication Networks. - Pooja Vyavahare; Nutan Limaye; D. Manjunath (CoRR, 2014)

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

Value Automata with Filters. - Michaël Cadilhac; Andreas Krebs; Nutan Limaye (CoRR, 2015)

On the Maximum Rate of Networked Computation in a Capacitated Network. - Pooja Vyavahare; Nutan Limaye; D. Manjunath (CoRR, 2015)

The shifted partial derivative complexity of Elementary Symmetric Polynomials. - Hervé Fournier; Nutan Limaye; Meena Mahajan; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2015)

Lower bounds for non-commutative skew circuits. - Nutan Limaye; Guillaume Malod; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2015)

Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication. - Hervé Fournier; Nutan Limaye; Guillaume Malod; Srikanth Srinivasan 001 (SIAM J. Comput., 2015)

Cost Register Automata for Nested Words. - Andreas Krebs; Nutan Limaye; Michael Ludwig (COCOON, 2016)

An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP. - Nikhil Balaji; Nutan Limaye; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2016)

Isolation Lemma for Directed Reachability and NL vs. L. - Vaibhav Krishan; Nutan Limaye (Electron. Colloquium Comput. Complex., 2016)

Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms. - Pooja Vyavahare; Nutan Limaye; D. Manjunath (IEEE/ACM Trans. Netw., 2016)

A Unified Method for Placing Problems in Polylogarithmic Depth. - Andreas Krebs; Nutan Limaye; Michael Ludwig (Electron. Colloquium Comput. Complex., 2017)

An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. - Neeraj Kayal; Nutan Limaye; Chandan Saha 001; Srikanth Srinivasan 001 (SIAM J. Comput., 2017)

On the Maximum Rate of Networked Computation in a Capacitated Network. - Pooja Vyavahare; Nutan Limaye; Ajit A. Diwan; D. Manjunath (IEEE/ACM Trans. Netw., 2017)

A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas. - Suryajith Chillara; Nutan Limaye; Srikanth Srinivasan 001 (ICALP, 2018)

A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. - Swapnam Bajpai; Vaibhav Krishan; Deepanshu Kush; Nutan Limaye; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2018)

Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes. - Prasad Chaugule; Nutan Limaye; Aditya Varre (Electron. Colloquium Comput. Complex., 2018)

A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. - Suryajith Chillara; Christian Engels; Nutan Limaye; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 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)

Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees. - Guillaume Lagarde; Nutan Limaye; Srikanth Srinivasan 001 (Comput. Complex., 2019)

Schur Polynomials do not have small formulas if the Determinant doesn't! - Prasad Chaugule; Mrinal Kumar 001; Nutan Limaye; Chandra Kanta Mohapatra; Adrian She; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2019)

More on $AC^0[ oplus]$ and Variants of the Majority Function. - Nutan Limaye; Srikanth Srinivasan 001; Utkarsh Tripathi (Electron. Colloquium Comput. Complex., 2019)

Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications. - Suryajith Chillara; Nutan Limaye; Srikanth Srinivasan 001 (SIAM J. Comput., 2019)

Variants of the Determinant polynomial and VP-completeness. - Prasad Chaugule; Nutan Limaye; Shourya Pandey (Electron. Colloquium Comput. Complex., 2020)

Skew circuits of small width. - Nikhil Balaji; Andreas Krebs; Nutan Limaye (Theor. Comput. Sci., 2020)

New Non-FPT Lower Bounds for Some Arithmetic Formulas. - Nutan Limaye; Srikanth Srinivasan 001; Sébastien Tavenas (Electron. Colloquium Comput. Complex., 2021)

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)

Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication. - Sébastien Tavenas; Nutan Limaye; Srikanth Srinivasan 001 (STOC, 2022)

On the VNP-hardness of Some Monomial Symmetric Polynomials. - Radu Curticapean; Nutan Limaye; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2022)

On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. - Nutan Limaye; Srikanth Srinivasan 001; Sébastien Tavenas (Electron. Colloquium Comput. Complex., 2022)

Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits. - Nutan Limaye; Srikanth Srinivasan 001; Sébastien Tavenas (SIGACT News, 2022)

On the Power of Homogeneous Algebraic Formulas. - Hervé Fournier; Nutan Limaye; Srikanth Srinivasan 001; Sébastien Tavenas (Electron. Colloquium Comput. Complex., 2023)

Towards Optimal Depth-Reductions for Algebraic Formulas. - Hervé Fournier; Nutan Limaye; Guillaume Malod; Srikanth Srinivasan 001; Sébastien Tavenas (Electron. Colloquium Comput. Complex., 2023)

Schur Polynomials Do Not Have Small Formulas If the Determinant does not. - Prasad Chaugule; Mrinal Kumar 001; Nutan Limaye; Chandra Kanta Mohapatra; Adrian She; Srikanth Srinivasan 001 (Comput. Complex., 2023)

On the geometry of k-SAT solutions: what more can PPZ and Schöning's algorithms do? - Per Austrin; Ioana O. Bercea; Mayank Goswami 001; Nutan Limaye; Adarsh Srinivasan (CoRR, 2024)

On the closures of monotone algebraic classes and variants of the determinant. - Prasad Chaugule; Nutan Limaye (Electron. Colloquium Comput. Complex., 2024)

Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers. - Tuomas Hakoniemi; Nutan Limaye; Iddo Tzameret (Electron. Colloquium Comput. Complex., 2024)

Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. - Nutan Limaye; Srikanth Srinivasan 001; Sébastien Tavenas (Commun. ACM, 2024)

Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments. - Per Austrin; Ioana O. Bercea; Mayank Goswami 001; Nutan Limaye; Adarsh Srinivasan (ICALP, 2025)

#SAT-Algorithms for Classes of Threshold Circuits Based on Probabilistic Rank. - Nutan Limaye; Adarsh Srinivasan; Srikanth Srinivasan 001 (MFCS, 2025)

New Bounds for the Ideal Proof System in Positive Characteristic. - Amik Raj Behera; Nutan Limaye; Varun Ramanathan 002; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2025)