Nikhil Srivastava

Nikhil Srivastava's AcademicInfluence.com Rankings

Nikhil Srivastava

Mathematics

#519

World Rank

#1010

Historical Rank

Measure Theory

#4596

World Rank

#5379

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Nikhil Srivastava Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Nikhil Srivastava is an associate professor of Mathematics at University of California, Berkeley. In July 2014, he was named a recipient of the Pólya Prize with Adam Marcus and Daniel Spielman. Early life and education Nikhil Srivastava was born New Delhi, India. He attended Union College in Schenectady, New York, graduating summa cum laude with a Bachelor of Science degree in mathematics and computer science in 2005. He received a PhD in computer science from Yale University in 2010 .

(See a Problem?)

Nikhil Srivastava's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Graph sparsification by effective resistances (2008) (878)
Twice-ramanujan sparsifiers (2008) (513)
Interlacing families II: Mixed characteristic polynomials and the Kadison{Singer problem (2013) (490)
Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees (2013) (367)
Spectral sparsification of graphs: theory and algorithms (2013) (172)
Covariance estimation for distributions with 2+ε moments (2011) (108)
An elementary proof of the restricted invertibility theorem (2009) (107)
A new approach to computing maximum flows using electrical flows (2013) (91)
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes (2015) (84)
On Contact Points of Convex Bodies (2012) (65)
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting (2007) (51)
Ramanujan Graphs and the Solution of the Kadison-Singer Problem (2014) (39)
On the longest path algorithm for reconstructing trees from distance matrices (2007) (34)
Spectral sparsification and restricted invertibility (2010) (33)
Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time (2019) (30)
Finite free convolutions of polynomials (2015) (26)
A matrix expander Chernoff bound (2017) (22)
Group Synchronization on Grids (2017) (18)
Voting with rubber bands, weights, and strings (2012) (16)
Optimal Lower Bounds for Sketching Graph Cuts (2017) (16)
The Solution of the Kadison-Singer Problem (2017) (13)
Localization of Electrical Flows (2017) (12)
High-girth near-Ramanujan graphs with localized eigenvectors (2019) (11)
Interlacing families III: Sharper restricted invertibility estimates (2017) (11)
Graph densification (2012) (11)
Gaussian Regularization of the Pseudospectrum and Davies’ Conjecture (2019) (10)
Overlaps, Eigenvalue Gaps, and Pseudospectrum under real Ginibre and Absolutely Continuous Perturbations (2020) (8)
On Non-localization of Eigenvectors of High Girth Graphs (2018) (8)
The Kadison-Singer problem (2014) (7)
An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification (2017) (7)
Approximating the Largest Root and Applications to Interlacing Families (2017) (7)
Exponential lower bounds on spectrahedral representations of hyperbolicity cones (2017) (6)
Real Stability Testing (2016) (4)
Asymptotically Optimal Multi-Paving (2017) (4)
Discrepancy, Graphs, and the Kadison-Singer Problem (2013) (4)
Global Convergence of Hessenberg Shifted QR I: Dynamics (2021) (4)
Matrix Concentration for Expander Walks (2017) (3)
A Spectral Approach to Polytope Diameter (2021) (3)
Scalar Poincaré implies matrix Poincaré (2021) (3)
On Concentration Inequalities for Random Matrix Products (2020) (2)
Support of closed walks and second eigenvalue multiplicity of graphs (2021) (2)
Zero-One Rounding of Singular Vectors (2012) (2)
Global Convergence of Hessenberg Shifted QR III: Approximate Ritz Values via Shifted Inverse Iteration (2022) (1)
Support of Closed Walks and Second Eigenvalue Multiplicity of the Normalized Adjacency Matrix (2020) (1)
Bit Complexity of Jordan Normal Form and Spectral Factorization (2021) (1)
Support of Closed Walks and Second Eigenvalue Multiplicity of Regular Graphs (2020) (1)
On Eigenvalue Gaps of Integer Matrices (2022) (1)
Global Convergence of Hessenberg Shifted QR II: Numerical Stability (2022) (1)
Many nodal domains in random regular graphs (2021) (0)
Scalar Poincar\'e Implies Matrix Poincar\'e (2020) (0)
Math 270 : Interlacing Families Open Problems (2015) (0)
A ug 2 01 7 Localization of Electrical Flows (2018) (0)
An elementary proof of the restricted invertibility theorem (2011) (0)
Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization (2023) (0)
Math 270 : Geometry of Polynomials Fall 2015 Lecture 1 : Introduction , the Matching Polynomial (2015) (0)
J ul 2 01 9 FINITE FREE CONVOLUTIONS VIA WEINGARTEN CALCULUS (2019) (0)

This paper list is powered by the following services:

Other Resources About Nikhil Srivastava

What Schools Are Affiliated With Nikhil Srivastava?

Nikhil Srivastava is affiliated with the following schools:

Nikhil Srivastava's Academic­Influence.com Rankings