| 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 | 91 | 2014 |
| 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 | 90 | 2009 |
| 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 | 83 | 2017 |
| 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 | 33 | 2022 |
| Upper bounds for monotone planar circuit value and variants N Limaye, M Mahajan, JMN Sarma computational complexity 18, 377-412, 2009 | 26 | 2009 |
| 3-connected planar graph isomorphism is in log-space S Datta, N Limaye, P Nimbhorkar arXiv preprint arXiv:0806.1041, 2008 | 26 | 2008 |
| Streaming algorithms for language recognition problems A Babu, N Limaye, J Radhakrishnan, G Varma arXiv preprint arXiv:1104.0848, 2011 | 25 | 2011 |
| 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 | 24 | 2019 |
| 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 | 23 | 2014 |
| 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 | 22 | 2018 |
| Lower bounds for non-commutative skew circuits N Limaye, G Malod, S Srinivasan Theory of Computing 12 (1), 1-38, 2016 | 22 | 2016 |
| 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 | 20 | 2010 |
| Streaming algorithms for recognizing nearly well-parenthesized expressions A Krebs, N Limaye, S Srinivasan Mathematical Foundations of Computer Science 2011: 36th International …, 2011 | 19 | 2011 |
| Arithmetizing Classes Around NC 1 and L N Limaye, M Mahajan, BVR Rao STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science …, 2007 | 18* | 2007 |
| Evaluating monotone circuits on cylinders, planes and tori N Limaye, M Mahajan, MN Jayalal Sarma STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science …, 2006 | 18 | 2006 |
| Longest paths in planar dags in unambiguous logspace N Limaye, M Mahajan, P Nimbhorkar arXiv preprint arXiv:0802.1699, 2008 | 17 | 2008 |
| 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 | 16 | 2015 |
| 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 | 15 | 2019 |
| Planarity, determinants, permanents, and (unique) matchings S Datta, R Kulkarni, N Limaye, M Mahajan Lecture Notes in Computer Science 4649, 115, 2007 | 14 | 2007 |
| Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees G Lagarde, N Limaye, S Srinivasan computational complexity 28, 471-542, 2019 | 13 | 2019 |
Srikanth SrinivasanDepartment of Computer Science, Aarhus UniversityVerified email at cs.au.dk
