Follow
Nikhil Srivastava
Title
Cited by
Cited by
Year
Graph sparsification by effective resistances
DA Spielman, N Srivastava
Proceedings of the fortieth annual ACM symposium on Theory of computing, 563-568, 2008
9232008
Interlacing families II: Mixed characteristic polynomials and the Kadison—Singer problem
AW Marcus, DA Spielman, N Srivastava
Annals of Mathematics, 327-350, 2015
4332015
Twice-ramanujan sparsifiers
JD Batson, DA Spielman, N Srivastava
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
4282009
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
3642013
Spectral sparsification of graphs: theory and algorithms
J Batson, DA Spielman, N Srivastava, SH Teng
Communications of the ACM 56 (8), 87-94, 2013
2032013
Covariance Estimation for Distributions with 2+\epsilon Moments
N Srivastava, R Vershynin
The Annals of Probability, 3081-3111 41 (5), 3081-3111, 2013
113*2013
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
1052013
Interlacing families IV: Bipartite Ramanujan graphs of all sizes
AW Marcus, DA Spielman, N Srivastava
SIAM Journal on Computing 47 (6), 2488-2509, 2018
932018
Twice-ramanujan sparsifiers
J Batson, DA Spielman, N Srivastava
siam REVIEW 56 (2), 315-334, 2014
782014
An elementary proof of the restricted invertibility theorem
DA Spielman, N Srivastava
Israel Journal of Mathematics 190 (1), 83-91, 2012
732012
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
582007
Finite free convolutions of polynomials
A Marcus, DA Spielman, N Srivastava
arXiv preprint arXiv:1504.00350, 2015
472015
Ramanujan graphs and the solution of the Kadison-Singer problem
AW Marcus, DA Spielman, N Srivastava
arXiv preprint arXiv:1408.4421, 2014
432014
On the longest path algorithm for reconstructing trees from distance matrices
L Reyzin, N Srivastava
Information processing letters 101 (3), 98-100, 2007
382007
Spectral sparsification and restricted invertibility
N Srivastava
342010
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
222022
Group synchronization on grids
E Abbe, L Massoulie, A Montanari, A Sly, N Srivastava
Mathematical Statistics and Learning 1 (3), 227-256, 2018
212018
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
202018
On contact points of convex bodies
N Srivastava
Geometric aspects of functional analysis, 393-412, 2012
182012
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
142012
The system can't perform the operation now. Try again later.
Articles 1–20