Folgen
Nutan Limaye
Nutan Limaye
Associate Professor, Computer Science, IT University of Copenhagen, Denmark
Bestätigte E-Mail-Adresse bei itu.dk
Titel
Zitiert von
Zitiert von
Jahr
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
1012009
Lower bounds for depth 4 formulas computing iterated matrix multiplication
H Fournier, N Limaye, G Malod, S Srinivasan
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
962014
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
892017
Superpolynomial lower bounds against low-depth algebraic circuits
N Limaye, S Srinivasan, S Tavenas
Communications of the ACM 67 (2), 101-108, 2024
492024
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
292019
Streaming algorithms for language recognition problems
A Babu, N Limaye, J Radhakrishnan, G Varma
arXiv preprint arXiv:1104.0848, 2011
272011
3-connected planar graph isomorphism is in log-space
S Datta, N Limaye, P Nimbhorkar
arXiv preprint arXiv:0806.1041, 2008
262008
Upper bounds for monotone planar circuit value and variants
N Limaye, M Mahajan, JMN Sarma
computational complexity 18 (3), 377, 2009
252009
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
242018
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
232014
Lower bounds for non-commutative skew circuits
N Limaye, G Malod, S Srinivasan
Theory of Computing 12 (1), 1-38, 2016
222016
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
212011
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
212010
Arithmetizing Classes Around NC1 and L
N Limaye, M Mahajan, BVR Rao
Annual Symposium on Theoretical Aspects of Computer Science, 477-488, 2007
18*2007
Evaluating monotone circuits on cylinders, planes and tori
N Limaye, M Mahajan, MN Jayalal 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
162015
A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem
N Limaye, K Sreenivasaiah, S Srinivasan, U Tripathi, S Venkitesh
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 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
142007
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication
S Tavenas, N Limaye, S Srinivasan
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
132022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20