Nutan Limaye

131 papers A* 12A 9B 5C 2Misc 8Journal 86Unranked 9
YearRankTypeTitle / Venue / Authors
2026 J jnl
Multilinear Algebraic Branching Programs and the Min-Partition Rank Method.
Electron. Colloquium Comput. Complex.
Théo Borém Fabris, Nutan Limaye, Srikanth Srinivasan, Amir Yehudayoff
2026 A conf
On Closure Properties of Read-Once Oblivious Algebraic Branching Programs.
ITCS
Robert Andrews, Jules Armand, Prateek Dwivedi, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2026 J jnl
Separation Results for Constant-Depth and Multilinear Ideal Proof Systems.
CoRR
Amik Raj Behera, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan
2026 J jnl
Separation Results for Constant-Depth and Multilinear Ideal Proof Systems.
Electron. Colloquium Comput. Complex.
Amik Raj Behera, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan
2026 J jnl
Towards Optimal Depth-Reductions for Algebraic Formulas.
Comput. Complex.
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2025 B conf
#SAT-Algorithms for Classes of Threshold Circuits Based on Probabilistic Rank.
MFCS
Nutan Limaye, Adarsh Srinivasan, Srikanth Srinivasan
2025 A* conf
Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments.
ICALP
Per Austrin, Ioana O. Bercea, Mayank Goswami, Nutan Limaye, Adarsh Srinivasan
2025 A* conf
New Bounds for the Ideal Proof System in Positive Characteristic.
ICALP
Amik Raj Behera, Nutan Limaye, Varun Ramanathan, Srikanth Srinivasan
2025 J jnl
New Bounds for the Ideal Proof System in Positive Characteristic.
CoRR
Amik Raj Behera, Nutan Limaye, Varun Ramanathan, Srikanth Srinivasan
2025 J jnl
New Bounds for the Ideal Proof System in Positive Characteristic.
Electron. Colloquium Comput. Complex.
Amik Raj Behera, Nutan Limaye, Varun Ramanathan, Srikanth Srinivasan
2025 J jnl
On Closure Properties of Read-Once Oblivious Algebraic Branching Programs.
CoRR
Jules Armand, Prateek Dwivedi, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2025 J jnl
On Closure Properties of Read-Once Oblivious Algebraic Branching Programs.
Electron. Colloquium Comput. Complex.
Jules Armand, Prateek Dwivedi, Nutan Limaye, Magnus Rahbek Dalgaard Hansen, Srikanth Srinivasan, Sébastien Tavenas
2025 J jnl
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.
J. ACM
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2024 A* conf
Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers.
STOC
Tuomas Hakoniemi, Nutan Limaye, Iddo Tzameret
2024 J jnl
Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers.
CoRR
Tuomas Hakoniemi, Nutan Limaye, Iddo Tzameret
2024 J jnl
Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers.
Electron. Colloquium Comput. Complex.
Tuomas Hakoniemi, Nutan Limaye, Iddo Tzameret
2024 J jnl
On The Closures of Monotone Algebraic Classes and Variants of the Determinant.
Algorithmica
Prasad Chaugule, Nutan Limaye
2024 A* conf
On the Power of Homogeneous Algebraic Formulas.
STOC
Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2024 J jnl
On the closures of monotone algebraic classes and variants of the determinant.
Electron. Colloquium Comput. Complex.
Prasad Chaugule, Nutan Limaye
2024 J jnl
On the geometry of
CoRR
Per Austrin, Ioana O. Bercea, Mayank Goswami, Nutan Limaye, Adarsh Srinivasan
2024 J jnl
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.
Commun. ACM
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2023 J jnl
On the Power of Homogeneous Algebraic Formulas.
Electron. Colloquium Comput. Complex.
Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2023 J jnl
Schur Polynomials Do Not Have Small Formulas If the Determinant does not.
Comput. Complex.
Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
2023 A conf
Towards Optimal Depth-Reductions for Algebraic Formulas.
CCC
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2023 J jnl
Towards Optimal Depth-Reductions for Algebraic Formulas.
CoRR
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2023 J jnl
Towards Optimal Depth-Reductions for Algebraic Formulas.
Electron. Colloquium Comput. Complex.
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2022 J jnl
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates.
Algorithmica
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
2022 J jnl
Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits.
SIGACT News
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2022 B conf
On the Closures of Monotone Algebraic Classes and Variants of the Determinant.
LATIN
Prasad Chaugule, Nutan Limaye
2022 A conf
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials.
CCC
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2022 J jnl
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials.
Electron. Colloquium Comput. Complex.
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2022 — conf
On the VNP-Hardness of Some Monomial Symmetric Polynomials.
FSTTCS
Radu Curticapean, Nutan Limaye, Srikanth Srinivasan
2022 J jnl
On the VNP-hardness of Some Monomial Symmetric Polynomials.
Electron. Colloquium Comput. Complex.
Radu Curticapean, Nutan Limaye, Srikanth Srinivasan
2022 J jnl
Planar Graph Isomorphism Is in Log-Space.
ACM Trans. Comput. Theory
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
2022 A* conf
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication.
STOC
Sébastien Tavenas, Nutan Limaye, Srikanth Srinivasan
2021 J jnl
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem.
SIAM J. Comput.
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2021 J jnl
New Non-FPT Lower Bounds for Some Arithmetic Formulas.
Electron. Colloquium Comput. Complex.
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2021 A* conf
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.
FOCS
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2021 J jnl
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.
Electron. Colloquium Comput. Complex.
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2021 J jnl
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes.
ACM Trans. Comput. Theory
Prasad Chaugule, Nutan Limaye, Aditya Varre
2021 Misc conf
Variants of the Determinant Polynomial and the VP-Completeness.
CSR
Prasad Chaugule, Nutan Limaye, Shourya Pandey
2020 A conf
Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't.
CCC
Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
2020 J jnl
Skew circuits of small width.
Theor. Comput. Sci.
Nikhil Balaji, Andreas Krebs, Nutan Limaye
2020 J jnl
Variants of the Determinant polynomial and VP-completeness.
Electron. Colloquium Comput. Complex.
Prasad Chaugule, Nutan Limaye, Shourya Pandey
2019 A conf
A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates.
ITCS
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
2019 A* conf
A fixed-depth size-hierarchy theorem for AC
STOC
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2019 J jnl
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees.
Comput. Complex.
Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
2019 J jnl
More on $AC^0[\oplus]$ and Variants of the Majority Function.
Electron. Colloquium Comput. Complex.
Nutan Limaye, Srikanth Srinivasan, Utkarsh Tripathi
2019 — conf
More on AC^0[oplus] and Variants of the Majority Function.
FSTTCS
Nutan Limaye, Srikanth Srinivasan, Utkarsh Tripathi
2019 J jnl
Schur Polynomials do not have small formulas if the Determinant doesn't!
CoRR
Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
2019 J jnl
Schur Polynomials do not have small formulas if the Determinant doesn't!
Electron. Colloquium Comput. Complex.
Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan
2019 J jnl
Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications.
SIAM J. Comput.
Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
2019 Misc conf
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes.
COCOON
Prasad Chaugule, Nutan Limaye, Aditya Varre
2018 J jnl
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates.
CoRR
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
2018 J jnl
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates.
Electron. Colloquium Comput. Complex.
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan
2018 A* conf
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits.
FOCS
Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan
2018 J jnl
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits.
CoRR
Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan
2018 J jnl
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits.
Electron. Colloquium Comput. Complex.
Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan
2018 A* conf
A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas.
ICALP
Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
2018 A conf
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications.
STACS
Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
2018 J jnl
The Coin Problem in Constant Depth: Sample Complexity and Parity Gates.
CoRR
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2018 J jnl
The Coin Problem in Constant Depth: Sample Complexity and Parity gates.
Electron. Colloquium Comput. Complex.
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2018 J jnl
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes.
Electron. Colloquium Comput. Complex.
Prasad Chaugule, Nutan Limaye, Aditya Varre
2017 — conf
A Unified Method for Placing Problems in Polylogarithmic Depth.
FSTTCS
Andreas Krebs, Nutan Limaye, Michael Ludwig
2017 J jnl
A Unified Method for Placing Problems in Polylogarithmic Depth.
Electron. Colloquium Comput. Complex.
Andreas Krebs, Nutan Limaye, Michael Ludwig
2017 J jnl
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas.
SIAM J. Comput.
Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan
2017 B conf
Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees.
MFCS
Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
2017 J jnl
Lower Bounds and PIT for Non-Commutative Arithmetic circuits with Restricted Parse Trees.
Electron. Colloquium Comput. Complex.
Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
2017 J jnl
On the Maximum Rate of Networked Computation in a Capacitated Network.
IEEE/ACM Trans. Netw.
Pooja Vyavahare, Nutan Limaye, Ajit A. Diwan, D. Manjunath
2017 J jnl
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications.
CoRR
Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
2017 J jnl
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications.
Electron. Colloquium Comput. Complex.
Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan
2017 J jnl
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials.
Theory Comput.
Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan
2016 J jnl
An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP.
Electron. Colloquium Comput. Complex.
Nikhil Balaji, Nutan Limaye, Srikanth Srinivasan
2016 Misc conf
Cost Register Automata for Nested Words.
COCOON
Andreas Krebs, Nutan Limaye, Michael Ludwig
2016 J jnl
Isolation Lemma for Directed Reachability and NL vs. L.
Electron. Colloquium Comput. Complex.
Vaibhav Krishan, Nutan Limaye
2016 J jnl
Lower Bounds for Non-Commutative Skew Circuits.
Theory Comput.
Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2016 J jnl
Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms.
IEEE/ACM Trans. Netw.
Pooja Vyavahare, Nutan Limaye, D. Manjunath
2016 J jnl
Small Depth Proof Systems.
ACM Trans. Comput. Theory
Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2016 J jnl
Space-Efficient Approximations for Subset Sum.
ACM Trans. Comput. Theory
Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2015 J jnl
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication.
SIAM J. Comput.
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2015 J jnl
Lower bounds for non-commutative skew circuits.
Electron. Colloquium Comput. Complex.
Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2015 J jnl
On the Maximum Rate of Networked Computation in a Capacitated Network.
CoRR
Pooja Vyavahare, Nutan Limaye, D. Manjunath
2015 Misc conf
Skew Circuits of Small Width.
COCOON
Nikhil Balaji, Andreas Krebs, Nutan Limaye
2015 — conf
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials.
MFCS (2)
Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan
2015 J jnl
The shifted partial derivative complexity of Elementary Symmetric Polynomials.
Electron. Colloquium Comput. Complex.
Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan
2015 J jnl
Value Automata with Filters.
CoRR
Michaël Cadilhac, Andreas Krebs, Nutan Limaye
2014 A* conf
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas.
FOCS
Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan
2014 J jnl
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas.
Electron. Colloquium Comput. Complex.
Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan
2014 J jnl
Efficient Embedding of Functions in Weighted Communication Networks.
CoRR
Pooja Vyavahare, Nutan Limaye, D. Manjunath
2014 — conf
Information friction limits on computation.
Allerton
Pooja Vyavahare, Majid Mahzoon, Pulkit Grover, Nutan Limaye, D. Manjunath
2014 A* conf
Lower bounds for depth 4 formulas computing iterated matrix multiplication.
STOC
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2014 J jnl
Skew Circuits of Small Width.
Electron. Colloquium Comput. Complex.
Nikhil Balaji, Andreas Krebs, Nutan Limaye
2014 J jnl
Space-Efficient Approximations for Subset Sum.
Electron. Colloquium Comput. Complex.
Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2014 A* conf
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas.
STOC
Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan
2013 — conf
DLOGTIME Proof Systems.
FSTTCS
Andreas Krebs, Nutan Limaye
2013 J jnl
Lower bounds for depth 4 formulas computing iterated matrix multiplication.
Electron. Colloquium Comput. Complex.
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2013 B conf
Small Depth Proof Systems.
MFCS
Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2013 J jnl
Small Depth Proof Systems.
CoRR
Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2013 J jnl
Small Depth Proof Systems.
Electron. Colloquium Comput. Complex.
Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2013 J jnl
Streaming algorithms for language recognition problems.
Theor. Comput. Sci.
Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, Girish Varma
2012 J jnl
Counting Paths in VPA Is Complete for #NC 1.
Algorithmica
Andreas Krebs, Nutan Limaye, Meena Mahajan
2012 J jnl
DLOGTIME-Proof Systems.
Electron. Colloquium Comput. Complex.
Andreas Krebs, Nutan Limaye
2012 J jnl
In-Network Estimation of Frequency Moments
CoRR
Pooja Vyavahare, Nutan Limaye, D. Manjunath
2012 J jnl
Streaming algorithms for recognizing nearly well-parenthesized expressions
CoRR
Andreas Krebs, Nutan Limaye, Srikanth Srinivasan
2012 Misc conf
The Complexity of Unary Subset Sum.
COCOON
Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2011 B conf
Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions.
MFCS
Andreas Krebs, Nutan Limaye, Srikanth Srinivasan
2011 J jnl
Streaming algorithms for language recognition problems
CoRR
Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, Girish Varma
2010 J jnl
Arithmetizing Classes Around NC\textsf{NC}
Theory Comput. Syst.
Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao
2010 Misc conf
Counting Paths in VPA Is Complete for #NC
COCOON
Andreas Krebs, Nutan Limaye, Meena Mahajan
2010 J jnl
Counting paths in VPA is complete for #NC
Electron. Colloquium Comput. Complex.
Andreas Krebs, Nutan Limaye, Meena Mahajan
2010 J jnl
Longest Paths in Planar DAGs in Unambiguous Log-Space.
Chic. J. Theor. Comput. Sci.
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
2010 J jnl
Planarity, Determinants, Permanents, and (Unique) Matchings.
ACM Trans. Comput. Theory
Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan
2010 C conf
Streaming Algorithms for Some Problems in Log-Space.
TAMC
Ajesh Babu, Nutan Limaye, Girish Varma
2010 J jnl
Streaming algorithms for some problems in log-space.
Electron. Colloquium Comput. Complex.
Ajesh Babu, Nutan Limaye, Girish Varma
2009 — conf
Longest Paths in Planar DAGs in Unambiguous Logspace.
CATS
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
2009 C conf
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata.
LATA
Nutan Limaye, Meena Mahajan
2009 J jnl
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.
J. Autom. Lang. Comb.
Nutan Limaye, Meena Mahajan, Antoine Meyer
2009 A conf
Planar Graph Isomorphism is in Log-Space.
CCC
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
2009 — conf
Planar Graph Isomorphism is in Log-Space.
Algebraic Methods in Computational Complexity
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
2009 J jnl
Planar Graph Isomorphism is in Log-space.
Electron. Colloquium Comput. Complex.
Fabian Wagner, Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf
2009 J jnl
Upper Bounds for Monotone Planar Circuit Value and Variants.
Comput. Complex.
Nutan Limaye, Meena Mahajan, Jayalal Sarma
2008 J jnl
3-connected Planar Graph Isomorphism is in Log-space
CoRR
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar
2008 — conf
3-connected Planar Graph Isomorphism is in Log-space.
FSTTCS
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar
2008 J jnl
A Log-space Algorithm for Canonization of Planar Graphs
CoRR
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
2008 J jnl
Longest paths in Planar DAGs in Unambiguous Logspace
CoRR
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
2008 Misc conf
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.
CSR
Nutan Limaye, Meena Mahajan, Antoine Meyer
2007 A conf
Arithmetizing Classes Around NC
STACS
Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao
2007 J jnl
Arithmetizing classes around NC^1 and L.
Electron. Colloquium Comput. Complex.
Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao
2007 Misc conf
Planarity, Determinants, Permanents, and (Unique) Matchings.
CSR
Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan
2006 J jnl
Evaluating Monotone Circuits on Cylinders, Planes and Tori
Electron. Colloquium Comput. Complex.
Nutan Limaye, Meena Mahajan, Jayalal Sarma
2006 A conf
Evaluating Monotone Circuits on Cylinders, Planes and Tori.
STACS
Nutan Limaye, Meena Mahajan, Jayalal Sarma