Nutan Limaye
Nutan Limaye
Associate Professor, Computer Science and Engineering, Indian Institute of Technology, Bombay, India
Verified email at cse.iitb.ac.in
Title
Cited by
Cited by
Year
Planar graph isomorphism is in log-space
S Datta, N Limaye, P Nimbhorkar, T Thierauf, F Wagner
2009 24th Annual IEEE Conference on Computational Complexity, 203-214, 2009
782009
Lower bounds for depth-4 formulas computing iterated matrix multiplication
H Fournier, N Limaye, G Malod, S Srinivasan
SIAM Journal on Computing 44 (5), 1173-1201, 2015
722015
An exponential lower bound for homogeneous depth four arithmetic formulas
N Kayal, N Limaye, C Saha, S Srinivasan
SIAM Journal on Computing 46 (1), 307-335, 2017
652017
Upper bounds for monotone planar circuit value and variants
N Limaye, M Mahajan, JMN Sarma
Computational Complexity 18 (3), 377, 2009
242009
3-connected planar graph isomorphism is in log-space
S Datta, N Limaye, P Nimbhorkar
arXiv preprint arXiv:0806.1041, 2008
242008
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
N Kayal, N Limaye, C Saha, S Srinivasan
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
192014
Streaming algorithms for language recognition problems
A Babu, N Limaye, J Radhakrishnan, G Varma
arXiv preprint arXiv:1104.0848, 2011
192011
Arithmetizing Classes Around NC 1 and L
N Limaye, M Mahajan, BVR Rao
Annual Symposium on Theoretical Aspects of Computer Science, 477-488, 2007
19*2007
Planarity, determinants, permanents, and (unique) matchings
S Datta, R Kulkarni, N Limaye, M Mahajan
ACM Transactions on Computation Theory (TOCT) 1 (3), 1-20, 2010
182010
Longest paths in planar dags in unambiguous logspace
N Limaye, M Mahajan, P Nimbhorkar
arXiv preprint arXiv:0802.1699, 2008
172008
Evaluating monotone circuits on cylinders, planes and tori
N Limaye, M Mahajan, MNJ Sarma
Annual Symposium on Theoretical Aspects of Computer Science, 660-671, 2006
172006
Lower bounds for non-commutative skew circuits
N Limaye, G Malod, S Srinivasan
Theory of Computing 12 (1), 1-38, 2016
162016
Small-depth multilinear formula lower bounds for iterated matrix multiplication with applications
S Chillara, N Limaye, S Srinivasan
SIAM Journal on Computing 48 (1), 70-92, 2019
152019
Planarity, determinants, permanents, and (unique) matchings
S Datta, R Kulkarni, N Limaye, M Mahajan
International Computer Science Symposium in Russia, 115-126, 2007
132007
Optimal embedding of functions for in-network computation: Complexity analysis and algorithms
P Vyavahare, N Limaye, D Manjunath
IEEE/ACM Transactions on Networking 24 (4), 2019-2032, 2015
112015
Streaming algorithms for recognizing nearly well-parenthesized expressions
A Krebs, N Limaye, S Srinivasan
International Symposium on Mathematical Foundations of Computer Science, 412-423, 2011
112011
A near-optimal depth-hierarchy theorem for small-depth multilinear circuits
S Chillara, C Engels, N Limaye, S Srinivasan
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
102018
On the complexity of membership and counting in height-deterministic pushdown automata
N Limaye, M Mahajan, A Meyer
International Computer Science Symposium in Russia, 240-251, 2008
102008
The Coin Problem in Constant Depth: Sample Complexity and Parity gates.
N Limaye, K Sreenivasaiah, S Srinivasan, U Tripathi, S Venkitesh
Electronic Colloquium on Computational Complexity (ECCC) 25, 157, 2018
72018
Streaming algorithms for some problems in log-space
A Babu, N Limaye, G Varma
International Conference on Theory and Applications of Models of Computation …, 2010
72010
The system can't perform the operation now. Try again later.
Articles 1–20