Nutan Limaye

Orcid: 0000-0002-0238-1674

Affiliations:
  • IT University of Copenhagen, Denmark


According to our database1, Nutan Limaye authored at least 61 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the closures of monotone algebraic classes and variants of the determinant.
Electron. Colloquium Comput. Complex., 2024

2023
Schur Polynomials Do Not Have Small Formulas If the Determinant does not.
Comput. Complex., June, 2023

Towards Optimal Depth-Reductions for Algebraic Formulas.
Electron. Colloquium Comput. Complex., 2023

On the Power of Homogeneous Algebraic Formulas.
Electron. Colloquium Comput. Complex., 2023

2022
Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits.
SIGACT News, 2022

On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials.
Electron. Colloquium Comput. Complex., 2022

On the VNP-hardness of Some Monomial Symmetric Polynomials.
Electron. Colloquium Comput. Complex., 2022

A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates.
Algorithmica, 2022

Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem.
SIAM J. Comput., 2021

New Non-FPT Lower Bounds for Some Arithmetic Formulas.
Electron. Colloquium Comput. Complex., 2021

Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.
Electron. Colloquium Comput. Complex., 2021

2020
Skew circuits of small width.
Theor. Comput. Sci., 2020

Variants of the Determinant polynomial and VP-completeness.
Electron. Colloquium Comput. Complex., 2020

2019
More on $AC^0[\oplus]$ and Variants of the Majority Function.
Electron. Colloquium Comput. Complex., 2019

Schur Polynomials do not have small formulas if the Determinant doesn't!
Electron. Colloquium Comput. Complex., 2019

Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees.
Comput. Complex., 2019

A fixed-depth size-hierarchy theorem for AC<sup>0</sup>[⊕] via the coin problem.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018
The Coin Problem in Constant Depth: Sample Complexity and Parity gates.
Electron. Colloquium Comput. Complex., 2018

A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits.
Electron. Colloquium Comput. Complex., 2018

Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes.
Electron. Colloquium Comput. Complex., 2018

A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
On the Maximum Rate of Networked Computation in a Capacitated Network.
IEEE/ACM Trans. Netw., 2017

The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials.
Theory Comput., 2017

A Unified Method for Placing Problems in Polylogarithmic Depth.
Electron. Colloquium Comput. Complex., 2017

Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications.
Electron. Colloquium Comput. Complex., 2017

2016
Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms.
IEEE/ACM Trans. Netw., 2016

Lower Bounds for Non-Commutative Skew Circuits.
Theory Comput., 2016

Isolation Lemma for Directed Reachability and NL vs. L.
Electron. Colloquium Comput. Complex., 2016

An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP.
Electron. Colloquium Comput. Complex., 2016

Cost Register Automata for Nested Words.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
On the Maximum Rate of Networked Computation in a Capacitated Network.
CoRR, 2015

Value Automata with Filters.
CoRR, 2015

2014
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas.
Electron. Colloquium Comput. Complex., 2014

Space-Efficient Approximations for Subset Sum.
Electron. Colloquium Comput. Complex., 2014

Efficient Embedding of Functions in Weighted Communication Networks.
CoRR, 2014

Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas.
Proceedings of the Symposium on Theory of Computing, 2014

Information friction limits on computation.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Streaming algorithms for language recognition problems.
Theor. Comput. Sci., 2013

Small Depth Proof Systems.
Electron. Colloquium Comput. Complex., 2013

Lower bounds for depth 4 formulas computing iterated matrix multiplication.
Electron. Colloquium Comput. Complex., 2013

2012
DLOGTIME-Proof Systems.
Electron. Colloquium Comput. Complex., 2012

In-Network Estimation of Frequency Moments
CoRR, 2012

Counting Paths in VPA Is Complete for #NC 1.
Algorithmica, 2012

The Complexity of Unary Subset Sum.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010
Planarity, Determinants, Permanents, and (Unique) Matchings.
ACM Trans. Comput. Theory, 2010

Arithmetizing Classes Around NC\textsf{NC}<sup>1</sup> and L\textsf{L}.
Theory Comput. Syst., 2010

Counting paths in VPA is complete for #NC<sup>1</sup>.
Electron. Colloquium Comput. Complex., 2010

Streaming algorithms for some problems in log-space.
Electron. Colloquium Comput. Complex., 2010

Longest Paths in Planar DAGs in Unambiguous Log-Space.
Chic. J. Theor. Comput. Sci., 2010

2009
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.
J. Autom. Lang. Comb., 2009

Planar Graph Isomorphism is in Log-space.
Electron. Colloquium Comput. Complex., 2009

Upper Bounds for Monotone Planar Circuit Value and Variants.
Comput. Complex., 2009

Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata.
Proceedings of the Language and Automata Theory and Applications, 2009

Longest Paths in Planar DAGs in Unambiguous Logspace.
Proceedings of the Theory of Computing 2009, 2009

2008
A Log-space Algorithm for Canonization of Planar Graphs
CoRR, 2008

3-connected Planar Graph Isomorphism is in Log-space.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007
Arithmetizing classes around NC^1 and L.
Electron. Colloquium Comput. Complex., 2007

Arithmetizing Classes Around NC <sup>1</sup> and L.
Proceedings of the STACS 2007, 2007

2006
Evaluating Monotone Circuits on Cylinders, Planes and Tori
Electron. Colloquium Comput. Complex., 2006


  Loading...