Concepedia

Nikhil Srivastava

NS

Statistics

Publications

28

Citations

2.5K

H-Index

20

Active since

2006

Affiliations

Yale University(Current)

University of California, Berkeley

Microsoft Research (India)

Banaras Hindu University

Berkeley College

Nikhil Srivastava is an author at Yale University specializing in mathematics, natural sciences, and combinatorics.

ORCID

Publications per year

2006–2022

28

Publications

28

Graph Sparsification by Effective Resistances

Daniel A. Spielman, Nikhil Srivastava · SIAM Journal on Computing · 2011 · 504 citations

, , +14

Interlacing families II: Mixed characteristic polynomials and the Kadison--Singer problem

Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava · Annals of Mathematics · 2015 · 384 citations

, , +4

Graph sparsification by effective resistances

Daniel A. Spielman, Nikhil Srivastava · 2008 · 251 citations

, , +14

Interlacing families I: Bipartite Ramanujan graphs of all degrees

Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava · Annals of Mathematics · 2015 · 231 citations

, , +8

Twice-Ramanujan Sparsifiers

Joshua Batson, Daniel A. Spielman, Nikhil Srivastava · SIAM Journal on Computing · 2012 · 224 citations

, , +14

1–5 of 28