| Graph sparsification by effective resistances DA Spielman, N Srivastava Proceedings of the fortieth annual ACM symposium on Theory of computing, 563-568, 2008 | 1049 | 2008 |
| Interlacing families ii: Mixed characteristic polynomials and the kadison—singer problem AW Marcus, DA Spielman, N Srivastava Annals of Mathematics, 327-350, 2015 | 480 | 2015 |
| Twice-ramanujan sparsifiers JD Batson, DA Spielman, N Srivastava Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 475 | 2009 |
| 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 | 425 | 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 | 237 | 2013 |
| Covariance Estimation for Distributions with 2+\epsilon Moments N Srivastava, R Vershynin The Annals of Probability, 3081-3111 41 (5), 3081-3111, 2013 | 122 | 2013 |
| Interlacing families IV: Bipartite Ramanujan graphs of all sizes AW Marcus, DA Spielman, N Srivastava SIAM Journal on Computing 47 (6), 2488-2509, 2018 | 114 | 2018 |
| 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 | 114 | 2013 |
| Twice-ramanujan sparsifiers J Batson, DA Spielman, N Srivastava siam REVIEW 56 (2), 315-334, 2014 | 93 | 2014 |
| An elementary proof of the restricted invertibility theorem DA Spielman, N Srivastava Israel Journal of Mathematics 190 (1), 83-91, 2012 | 74 | 2012 |
| Learning and verifying graphs using queries with a focus on edge counting L Reyzin, N Srivastava Algorithmic Learning Theory: 18th International Conference, ALT 2007, Sendai …, 2007 | 62 | 2007 |
| Finite free convolutions of polynomials A Marcus, DA Spielman, N Srivastava arXiv preprint arXiv:1504.00350, 2015 | 49 | 2015 |
| Ramanujan graphs and the solution of the Kadison-Singer problem AW Marcus, DA Spielman, N Srivastava arXiv preprint arXiv:1408.4421, 2014 | 47 | 2014 |
| Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time J Banks, J Garza-Vargas, A Kulkarni, N Srivastava Foundations of Computational Mathematics, 1-89, 2022 | 42 | 2022 |
| On the longest path algorithm for reconstructing trees from distance matrices L Reyzin, N Srivastava Information processing letters 101 (3), 98-100, 2007 | 39 | 2007 |
| Spectral sparsification and restricted invertibility N Srivastava Yale University, 2010 | 35 | 2010 |
| Group synchronization on grids E Abbe, L Massoulie, A Montanari, A Sly, N Srivastava Mathematical Statistics and Learning 1 (3), 227-256, 2018 | 25 | 2018 |
| 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 | 24 | 2018 |
| Finite free convolutions of polynomials AW Marcus, DA Spielman, N Srivastava Probability Theory and Related Fields 182 (3-4), 807-848, 2022 | 19 | 2022 |
| On contact points of convex bodies N Srivastava Geometric Aspects of Functional Analysis: Israel Seminar 2006–2010, 393-412, 2012 | 19 | 2012 |
Daniel SpielmanProfessor of Computer Science, Yale UniversityVerified email at yale.edu
