MOST CITED SCHOLAR PUBLICATIONS
- Lower bounds for depth 4 formulas computing iterated matrix multiplicationH Fournier, N Limaye, G Malod, S SrinivasanProceedings of the forty-sixth annual ACM symposium on Theory of computing 2014Citations: 96
- An exponential lower bound for homogeneous depth four arithmetic formulasN Kayal, N Limaye, C Saha, S SrinivasanSIAM Journal on Computing 46 (1), 307-335 2017Citations: 89
- New results on noncommutative and commutative polynomial identity testingV Arvind, P Mukhopadhyay, S SrinivasanComputational Complexity 19 (4), 521-558 2010Citations: 56
- Approximating AC^ 0 by small height decision trees and a deterministic algorithm for# AC^ 0SATP Beame, R Impagliazzo, S Srinivasan2012 IEEE 27th Conference on Computational Complexity, 117-125 2012Citations: 52
- Superpolynomial lower bounds against low-depth algebraic circuitsN Limaye, S Srinivasan, S TavenasCommunications of the ACM 67 (2), 101-108 2024Citations: 49
- On the hardness of the noncommutative determinantV Arvind, S SrinivasanProceedings of the forty-second ACM symposium on Theory of computing, 677-686 2010Citations: 49
- Average-case lower bounds and satisfiability algorithms for small threshold circuitsR Chen, R Santhanam, S SrinivasanarXiv preprint arXiv:1806.06290 2018Citations: 43
- A tail bound for read‐k families of functionsD Gavinsky, S Lovett, M Saks, S SrinivasanRandom Structures & Algorithms 47 (1), 99-108 2015Citations: 43
- Composition limits and separating examples for some Boolean function complexity measuresJ Gilmer, M Saks, S SrinivasanCombinatorica 36 (3), 265-311 2016Citations: 41
- On polynomial approximations to ACP Harsha, S SrinivasanRandom Structures & Algorithms 54 (2), 289-303 2019Citations: 31
- Arithmetic circuits and the hadamard product of polynomialsV Arvind, PS Joglekar, S SrinivasanarXiv preprint arXiv:0907.4006 2009Citations: 30
- Small-depth multilinear formula lower bounds for iterated matrix multiplication with applicationsS Chillara, N Limaye, S SrinivasanSIAM Journal on Computing 48 (1), 70-92 2019Citations: 29
- Super-polylogarithmic hypergraph coloring hardness via low-degree long codesV Guruswami, P Harsha, J Hstad, S Srinivasan, G VarmaProceedings of the forty-sixth annual ACM symposium on Theory of computing 2014Citations: 29
- Certifying polynomials for AC^ 0 (parity) circuits, with applicationsS Kopparty, S SrinivasanIARCS Annual Conference on Foundations of Software Technology and 2012Citations: for AC^ 0 (parity) circuits, with applications
- Certifying polynomials for AC^ 0 (parity) circuits, with applicationsS Kopparty, S SrinivasanIARCS Annual Conference on Foundations of Software Technology and 2012Citations: 28
- A near-optimal depth-hierarchy theorem for small-depth multilinear circuitsS Chillara, C Engels, N Limaye, S Srinivasan2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS 2018Citations: 24
- Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulasN Kayal, N Limaye, C Saha, S SrinivasanProceedings of the forty-sixth annual ACM symposium on Theory of computing 2014Citations: 23
- On the limits of sparsificationR Santhanam, S SrinivasanAutomata, Languages, and Programming: 39th International Colloquium, ICALP 2012Citations: 23
- Correlation Bounds for Poly-size Circuits with n 1− o (1) Symmetric GatesS Lovett, S SrinivasanInternational Workshop on Approximation Algorithms for Combinatorial 2011Citations: 23
- Lower bounds for non-commutative skew circuitsN Limaye, G Malod, S SrinivasanTheory of Computing 12 (1), 1-38 2016Citations: 22
