Follow
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
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
902015
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
862009
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
832017
Upper bounds for monotone planar circuit value and variants
N Limaye, M Mahajan, J Sarma
computational complexity 18 (3), 377-412, 2009
262009
3-connected planar graph isomorphism is in log-space
S Datta, N Limaye, P Nimbhorkar
arXiv preprint arXiv:0806.1041, 2008
262008
Streaming algorithms for language recognition problems
A Babu, N Limaye, J Radhakrishnan, G Varma
arXiv preprint arXiv:1104.0848, 2011
252011
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
242014
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
222019
Lower bounds for non-commutative skew circuits
N Limaye, G Malod, S Srinivasan
Theory of Computing 12 (1), 1-38, 2016
222016
Superpolynomial lower bounds against low-depth algebraic circuits
N Limaye, S Srinivasan, S Tavenas
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
202022
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
202010
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
192018
Arithmetizing Classes Around NC1 and L
N Limaye, M Mahajan, BV Rao
Annual Symposium on Theoretical Aspects of Computer Science, 477-488, 2007
19*2007
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
182011
Evaluating monotone circuits on cylinders, planes and tori
N Limaye, M Mahajan, J Sarma
Annual Symposium on Theoretical Aspects of Computer Science, 660-671, 2006
182006
Longest paths in planar dags in unambiguous logspace
N Limaye, M Mahajan, P Nimbhorkar
arXiv preprint arXiv:0802.1699, 2008
172008
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
152015
Planarity, determinants, permanents, and (unique) matchings
S Datta, R Kulkarni, N Limaye, M Mahajan
International Computer Science Symposium in Russia, 115-126, 2007
142007
A Fixed-Depth Size-Hierarchy Theorem for via the Coin Problem
N Limaye, K Sreenivasaiah, S Srinivasan, U Tripathi, S Venkitesh
SIAM Journal on Computing 50 (4), 1461-1499, 2021
112021
Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees
G Lagarde, N Limaye, S Srinivasan
computational complexity 28 (3), 471-542, 2019
112019
The system can't perform the operation now. Try again later.
Articles 1–20