Nikhil Srivastava

Publication Activity (10 Years)

Years Active: 2005-2023
Publications (10 Years): 40

Top Topics

Differential Equations

Global Convergence

Matrix Multiplication

Top Venues

Publications

Nikhil Srivastava, Vineet Kumar Singh
L3 approximation of Caputo derivative and its application to time-fractional wave equation-(I). Math. Comput. Simul. 205 (2023)
Nikhil Srivastava
The Complexity of Diagonalization. ISSAC (2023)
Jess Banks, Jorge Garza-Vargas, Archit Kulkarni, Nikhil Srivastava
Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time. Found. Comput. Math. 23 (6) (2023)
Nikhil Srivastava
The Complexity of Diagonalization. CoRR (2023)
Papri Dey, Ravi Kannan, Nick Ryder, Nikhil Srivastava
Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization. ITCS (2023)
Yashveer Kumar, Nikhil Srivastava, Aman Singh, Vineet Kumar Singh
Wavelets based computational algorithms for multidimensional distributed order fractional differential equations with nonlinear source term. Comput. Math. Appl. 132 (2023)
Aaron Abrams, Zeph Landau, Jamie Pommersheim, Nikhil Srivastava
On Eigenvalue Gaps of Integer Matrices. CoRR (2022)
Jess Banks, Jorge Garza-Vargas, Nikhil Srivastava
Global Convergence of Hessenberg Shifted QR III: Approximate Ritz Values via Shifted Inverse Iteration. CoRR (2022)
Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava
A Spectral Approach to Polytope Diameter. ITCS (2022)
Jess Banks, Jorge Garza-Vargas, Nikhil Srivastava
Global Convergence of Hessenberg Shifted QR II: Numerical Stability. CoRR (2022)
Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava
A Spectral Approach to Polytope Diameter. CoRR (2021)
Jess Banks, Jorge Garza-Vargas, Nikhil Srivastava
Global Convergence of Hessenberg Shifted QR I: Dynamics. CoRR (2021)
Shirshendu Ganguly, Theo McKenzie, Sidhanth Mohanty, Nikhil Srivastava
Many nodal domains in random regular graphs. CoRR (2021)
Theo McKenzie, Peter Michael Reichstein Rasmussen, Nikhil Srivastava
Support of closed walks and second eigenvalue multiplicity of graphs. STOC (2021)
Papri Dey, Ravi Kannan, Nick Ryder, Nikhil Srivastava
Bit Complexity of Jordan Normal Form and Spectral Factorization. CoRR (2021)
Yashveer Kumar, Somveer Singh, Nikhil Srivastava, Aman Singh, Vineet Kumar Singh
Wavelet approximation scheme for distributed order fractional differential equations. Comput. Math. Appl. 80 (8) (2020)
Theo McKenzie, Peter M. R. Rasmussen, Nikhil Srivastava
Support of Closed Walks and Second Eigenvalue Multiplicity of Regular Graphs. CoRR (2020)
Rahul Kumar Maurya, Vinita Devi, Nikhil Srivastava, Vineet Kumar Singh
An efficient and stable Lagrangian matrix approach to Abel integral and integro-differential equations. Appl. Math. Comput. 374 (2020)
Jess Banks, Jorge Garza-Vargas, Archit Kulkarni, Nikhil Srivastava
Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time. FOCS (2020)
Jess Banks, Jorge Garza-Vargas, Archit Kulkarni, Nikhil Srivastava
Overlaps, Eigenvalue Gaps, and Pseudospectrum under real Ginibre and Absolutely Continuous Perturbations. CoRR (2020)
Jess Banks, Archit Kulkarni, Satyaki Mukherjee, Nikhil Srivastava
Gaussian Regularization of the Pseudospectrum and Davies' Conjecture. CoRR (2019)
Noga Alon, Shirshendu Ganguly, Nikhil Srivastava
High-girth near-Ramanujan graphs with localized eigenvectors. CoRR (2019)
Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan
Optimal Lower Bounds for Sketching Graph Cuts. SODA (2019)
Jess Banks, Jorge Garza-Vargas, Archit Kulkarni, Nikhil Srivastava
Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time. CoRR (2019)
Prasad Raghavendra, Nick Ryder, Nikhil Srivastava, Benjamin Weitz
Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones. SODA (2019)
Nima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava
Approximating the Largest Root and Applications to Interlacing Families. SODA (2018)
Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. SIAM J. Comput. 47 (6) (2018)
Aaron Schild, Satish Rao, Nikhil Srivastava
Localization of Electrical Flows. SODA (2018)
Ankit Garg, Yin Tat Lee, Zhao Song, Nikhil Srivastava
A matrix expander Chernoff bound. STOC (2018)
Shirshendu Ganguly, Nikhil Srivastava
On Non-localization of Eigenvectors of High Girth Graphs. CoRR (2018)
Nikhil Srivastava, Luca Trevisan
An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification. SODA (2018)
Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan
Optimal Lower Bounds for Sketching Graph Cuts. CoRR (2017)
Prasad Raghavendra, Nick Ryder, Nikhil Srivastava
Real Stability Testing. ITCS (2017)
Aaron Schild, Satish Rao, Nikhil Srivastava
Localization of Electrical Flows. CoRR (2017)
Nikhil Srivastava, Luca Trevisan
An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification. CoRR (2017)
Prasad Raghavendra, Nick Ryder, Nikhil Srivastava, Benjamin Weitz
Exponential lower bounds on spectrahedral representations of hyperbolicity cones. CoRR (2017)
Ankit Garg, Nikhil Srivastava
Matrix Concentration for Expander Walks. CoRR (2017)
Emmanuel Abbe, Laurent Massoulié, Andrea Montanari, Allan Sly, Nikhil Srivastava
Group Synchronization on Grids. CoRR (2017)
Nima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava
Approximating the Largest Root and Applications to Interlacing Families. CoRR (2017)
Prasad Raghavendra, Nick Ryder, Nikhil Srivastava
Real Stability Testing. CoRR (2016)
Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. FOCS (2015)
Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava
Twice-Ramanujan Sparsifiers. SIAM Rev. 56 (2) (2014)
Yin Tat Lee, Satish Rao, Nikhil Srivastava
A new approach to computing maximum flows using electrical flows. STOC (2013)
Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava, Shang-Hua Teng
Spectral sparsification of graphs: theory and algorithms. Commun. ACM 56 (8) (2013)
Adam Marcus, Daniel A. Spielman, Nikhil Srivastava
Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees. FOCS (2013)
Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava
Twice-Ramanujan Sparsifiers. SIAM J. Comput. 41 (6) (2012)
Moritz Hardt, Nikhil Srivastava, Madhur Tulsiani
Graph densification. ITCS (2012)
Davide P. Cervone, Ronghua Dai, Daniel Gnoutcheff, Grant Lanterman, Andrew Mackenzie, Ari Morse, Nikhil Srivastava, William S. Zwicker
Voting with rubber bands, weights, and strings. Math. Soc. Sci. 64 (1) (2012)
Amit Deshpande, Ravindran Kannan, Nikhil Srivastava
Zero-One Rounding of Singular Vectors. ICALP (1) (2012)
Daniel A. Spielman, Nikhil Srivastava
Graph Sparsification by Effective Resistances. SIAM J. Comput. 40 (6) (2011)
Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava
Twice-ramanujan sparsifiers. STOC (2009)
Daniel A. Spielman, Nikhil Srivastava
Graph Sparsification by Effective Resistances CoRR (2008)
Daniel A. Spielman, Nikhil Srivastava
Graph sparsification by effective resistances. STOC (2008)
Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava
Twice-Ramanujan Sparsifiers CoRR (2008)
Lev Reyzin, Nikhil Srivastava
On the longest path algorithm for reconstructing trees from distance matrices. Inf. Process. Lett. 101 (3) (2007)
Lev Reyzin, Nikhil Srivastava
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting. ALT (2007)
Nikhil Srivastava, Alan D. Taylor
Tight bounds on plurality. Inf. Process. Lett. 96 (3) (2005)