Följ
Nikhil Srivastava
Nikhil Srivastava
Verifierad e-postadress på berkeley.edu - Startsida
Titel
Citeras av
Citeras av
År
Graph sparsification by effective resistances
DA Spielman, N Srivastava
Proceedings of the fortieth annual ACM symposium on Theory of computing, 563-568, 2008
10852008
Interlacing families ii: Mixed characteristic polynomials and the kadison—singer problem
AW Marcus, DA Spielman, N Srivastava
Annals of Mathematics, 327-350, 2015
5052015
Twice-ramanujan sparsifiers
JD Batson, DA Spielman, N Srivastava
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
4942009
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
4442013
Spectral sparsification of graphs: theory and algorithms
J Batson, DA Spielman, N Srivastava, SH Teng
Communications of the ACM 56 (8), 87-94, 2013
2472013
Covariance Estimation for Distributions with 2+\epsilon Moments
N Srivastava, R Vershynin
The Annals of Probability, 3081-3111 41 (5), 3081-3111, 2013
1302013
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
1232013
Interlacing families IV: Bipartite Ramanujan graphs of all sizes
AW Marcus, DA Spielman, N Srivastava
SIAM Journal on Computing 47 (6), 2488-2509, 2018
1132018
Twice-ramanujan sparsifiers
J Batson, DA Spielman, N Srivastava
siam REVIEW 56 (2), 315-334, 2014
1022014
An elementary proof of the restricted invertibility theorem
DA Spielman, N Srivastava
Israel Journal of Mathematics 190 (1), 83-91, 2012
782012
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
672007
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 23 (6), 1959-2047, 2023
532023
Ramanujan graphs and the solution of the Kadison-Singer problem
AW Marcus, DA Spielman, N Srivastava
arXiv preprint arXiv:1408.4421, 2014
472014
On the longest path algorithm for reconstructing trees from distance matrices
L Reyzin, N Srivastava
Information processing letters 101 (3), 98-100, 2007
412007
Finite free convolutions of polynomials
A Marcus, DA Spielman, N Srivastava
arXiv preprint arXiv:1504.00350, 2015
392015
Finite free convolutions of polynomials
AW Marcus, DA Spielman, N Srivastava
Probability Theory and Related Fields 182 (3), 807-848, 2022
382022
Spectral sparsification and restricted invertibility
N Srivastava
Yale University, 2010
342010
Group synchronization on grids
E Abbe, L Massoulie, A Montanari, A Sly, N Srivastava
Mathematical Statistics and Learning 1 (3), 227-256, 2018
252018
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
252018
Gaussian regularization of the pseudospectrum and Davies’ conjecture
J Banks, A Kulkarni, S Mukherjee, N Srivastava
Communications on Pure and Applied Mathematics 74 (10), 2114-2131, 2021
202021
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20