| Graph sparsification by effective resistances DA Spielman, N Srivastava SIAM Journal on Computing 40 (6), 1913-1926, 2011 | 777 | 2011 |
| Twice-ramanujan sparsifiers J Batson, DA Spielman, N Srivastava SIAM Journal on Computing 41 (6), 1704-1721, 2012 | 376 | 2012 |
| Interlacing families II: Mixed characteristic polynomials and the Kadison—Singer problem AW Marcus, DA Spielman, N Srivastava Annals of Mathematics, 327-350, 2015 | 360 | 2015 |
| Interlacing families I: Bipartite Ramanujan graphs of all degrees A Marcus, DA Spielman, N Srivastava 2013 IEEE 54th Annual Symposium on Foundations of computer science, 529-537, 2013 | 293 | 2013 |
| Spectral sparsification of graphs: theory and algorithms J Batson, DA Spielman, N Srivastava, SH Teng Communications of the ACM 56 (8), 87-94, 2013 | 160 | 2013 |
| Covariance Estimation for Distributions with 2+\epsilon Moments N Srivastava, R Vershynin arXiv preprint arXiv:1106.2775, 2011 | 100* | 2011 |
| A new approach to computing maximum flows using electrical flows YT Lee, S Rao, N Srivastava Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 91 | 2013 |
| An elementary proof of the restricted invertibility theorem DA Spielman, N Srivastava Israel Journal of Mathematics 190 (1), 83-91, 2012 | 68 | 2012 |
| Interlacing families IV: Bipartite Ramanujan graphs of all sizes AW Marcus, DA Spielman, N Srivastava SIAM Journal on Computing 47 (6), 2488-2509, 2018 | 66 | 2018 |
| Twice-ramanujan sparsifiers J Batson, DA Spielman, N Srivastava siam REVIEW 56 (2), 315-334, 2014 | 66 | 2014 |
| Learning and verifying graphs using queries with a focus on edge counting L Reyzin, N Srivastava International Conference on Algorithmic Learning Theory, 285-297, 2007 | 46 | 2007 |
| Finite free convolutions of polynomials A Marcus, DA Spielman, N Srivastava arXiv preprint arXiv:1504.00350, 2015 | 37 | 2015 |
| Ramanujan graphs and the solution of the Kadison-Singer problem AW Marcus, DA Spielman, N Srivastava arXiv preprint arXiv:1408.4421, 2014 | 33 | 2014 |
| Spectral sparsification and restricted invertibility N Srivastava | 28 | 2010 |
| On the longest path algorithm for reconstructing trees from distance matrices L Reyzin, N Srivastava Information processing letters 101 (3), 98-100, 2007 | 28 | 2007 |
| Group synchronization on grids E Abbe, L Massoulie, A Montanari, A Sly, N Srivastava Mathematical Statistics and Learning 1 (3), 227-256, 2018 | 17 | 2018 |
| On contact points of convex bodies N Srivastava Geometric aspects of functional analysis, 393-412, 2012 | 15 | 2012 |
| A matrix expander chernoff bound A Garg, YT Lee, Z Song, N Srivastava Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 14* | 2018 |
| Voting with rubber bands, weights, and strings DP Cervone, R Dai, D Gnoutcheff, G Lanterman, A Mackenzie, A Morse, ... Mathematical Social Sciences 64 (1), 11-27, 2012 | 14 | 2012 |
| Graph densification M Hardt, N Srivastava, M Tulsiani Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012 | 13 | 2012 |
Daniel SpielmanProfessor of Computer Science, Yale UniversityVerified email at yale.edu
