☰

Nikhil Srivastava

Affiliations: 
Mathematics University of California, Berkeley, Berkeley, CA, United States 
Area:
Theoretical computer science, random matrices, geometry of polynomials
Google:
"Nikhil Srivastava"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor

Children

Sign in to add trainee

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Marcus AW, Spielman DA, Srivastava N. (2015) Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 1358-1377
Batson J, Spielman DA, Srivastava N. (2014) Twice-ramanujan sparsifiers Siam Review. 56: 315-334
Batson J, Spielman DA, Srivastava N, et al. (2013) Spectral sparsification of graphs: Theory and algorithms Communications of the Acm. 56: 87-94
Batson JD, Spielman DA, Srivastava N. (2012) Twice-Ramanujan Sparsifiers Siam Journal On Computing. 41: 1704-1721
Spielman DA, Srivastava N. (2011) Graph sparsification by effective resistances Siam Journal On Computing. 40: 1913-1926
See more...