Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Nutan Limaye
Observed names:
LIMAYE, N,
Limaye, Nutan,
N. Limaye
Institution:
IT University of Copenhagen
Observed institutions:
Tata Institute of Fundamental Research,
University of Copenhagen,
Indian Institute of Technology Bombay,
Institute of Mathematical Sciences,
Institute of Mathematical Sciences,
University of Tübingen,
IT University of Copenhagen
show all 7
ORCID:
0000-0002-0238-1674
Observed ORCID:
0000-0002-0238-1674
OpenAlex ID:
A5083072245
Works
99
Awards
2
Planar Graph Isomorphism is in Log-Space
2009
·
Samir Datta
, Nutan Limaye
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
67
Lower bounds for depth 4 formulas computing iterated matrix multiplication
2014
·
Hervé Fournier
, Nutan Limaye
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
57
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
2022
·
Nutan Limaye
, Srikanth Srinivasan
, et al.
·
Annual Symposium on Foundations of Computer Science
·
49
PDF
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
2014
·
Neeraj Kayal
, Nutan Limaye
, et al.
·
Annual Symposium on Foundations of Computer Science
·
42
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication
2015
·
Hervé Fournier
, Nutan Limaye
, et al.
·
SIAM Journal on Computing
·
28
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
2017
·
Neeraj Kayal
, Nutan Limaye
, et al.
·
SIAM Journal on Computing
·
24
Streaming algorithms for language recognition problems
2013
·
Ajesh Babu
, Nutan Limaye
, et al.
·
Theoretical Computer Science
·
24
PDF
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
2014
·
Neeraj Kayal
, Nutan Limaye
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
23
Upper Bounds for Monotone Planar Circuit Value and Variants
2009
·
Nutan Limaye
, Meena Mahajan
, et al.
·
Computational Complexity
·
23
Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications
2019
·
Suryajith Chillara
, Nutan Limaye
, et al.
·
SIAM Journal on Computing
·
19
PDF
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem
2021
·
Nutan Limaye
, Karteek Sreenivasaiah
, et al.
·
SIAM Journal on Computing
·
18
PDF
Evaluating Monotone Circuits on Cylinders, Planes and Tori
2006
·
Nutan Limaye
, Meena Mahajan
, et al.
·
Lecture notes in computer science
·
18
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits
2018
·
Suryajith Chillara
, Christian Engels
, et al.
·
Annual Symposium on Foundations of Computer Science
·
17
PDF
Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions
2011
·
Andreas Krebs
, Nutan Limaye
, et al.
·
Lecture notes in computer science
·
17
PDF
Planarity, Determinants, Permanents, and (Unique) Matchings
2010
·
Samir Datta
, Raghav Kulkarni
, et al.
·
ACM Transactions on Computation Theory
·
16
Arithmetizing Classes Around NC 1 and L
2007
·
Nutan Limaye
, Meena Mahajan
, et al.
·
Springer eBooks
·
16
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
2024
·
Nutan Limaye
, Srikanth Srinivasan
, et al.
·
Journal of the ACM
·
15
PDF
Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms
2015
·
Pooja Vyavahare
, Nutan Limaye
, et al.
·
IEEE/ACM Transactions on Networking
·
14
PDF
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication
2022
·
Sébastien Tavenas
, Nutan Limaye
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
12
PDF
Planar Graph Isomorphism Is in Log-Space
2022
·
Samir Datta
, Nutan Limaye
, et al.
·
ACM Transactions on Computation Theory
·
10
PDF
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees
2018
·
Guillaume Lagarde
, Nutan Limaye
, et al.
·
Computational Complexity
·
10
PDF
3-connected Planar Graph Isomorphism is in Log-space
2008
·
Datta, Samir
, Limaye, Nutan
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
10
PDF
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
2008
·
Nutan Limaye
, Meena Mahajan
, et al.
·
Springer eBooks
·
9
Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers
2024
·
Tuomas Hakoniemi
, Nutan Limaye
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
8
Streaming Algorithms for Some Problems in Log-Space
2010
·
Ajesh Babu
, Nutan Limaye
, et al.
·
Lecture notes in computer science
·
8
Show more works
View as search
Works count:
99
Citation count:
732
H-index:
16
I10-index:
22
Year
Topic
Type
