Skip to content

Nikhil Srivastava

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

16

Venues

6

Active years

2007–2023

Best venue rank

A*

Where they publish

Papers

16 indexed papers, newest first.

YearVenueTitleAuthors
2023ISSACThe Complexity of Diagonalization.Nikhil Srivastava
2021STOCSupport of closed walks and second eigenvalue multiplicity of graphs.Theo McKenzie, Peter Michael Reichstein Rasmussen, Nikhil Srivastava
2020FOCSPseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time.Jess Banks, Jorge Garza-Vargas, Archit Kulkarni, Nikhil Srivastava
2019SODAOptimal Lower Bounds for Sketching Graph Cuts.Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan
2019SODAExponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones.Prasad Raghavendra, Nick Ryder, Nikhil Srivastava, Benjamin Weitz
2018SODAApproximating the Largest Root and Applications to Interlacing Families.Nima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava
2018SODALocalization of Electrical Flows.Aaron Schild, Satish Rao, Nikhil Srivastava
2018SODAAn Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification.Nikhil Srivastava, Luca Trevisan
2018STOCA matrix expander Chernoff bound.Ankit Garg, Yin Tat Lee, Zhao Song, Nikhil Srivastava
2015FOCSInterlacing Families IV: Bipartite Ramanujan Graphs of All Sizes.Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava
2013FOCSInterlacing Families I: Bipartite Ramanujan Graphs of All Degrees.Adam Marcus, Daniel A. Spielman, Nikhil Srivastava
2013STOCA new approach to computing maximum flows using electrical flows.Yin Tat Lee, Satish Rao, Nikhil Srivastava
2012ICALPZero-One Rounding of Singular Vectors.Amit Deshpande, Ravindran Kannan, Nikhil Srivastava
2009STOCTwice-ramanujan sparsifiers.Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava
2008STOCGraph sparsification by effective resistances.Daniel A. Spielman, Nikhil Srivastava
2007ALTLearning and Verifying Graphs Using Queries with a Focus on Edge Counting.Lev Reyzin, Nikhil Srivastava