Nikhil Srivastava

According to our database, Nikhil Srivastava authored at least 41 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

A Spectral Approach to Polytope Diameter.

Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava

Discret. Comput. Geom., December, 2024

2023

Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time.

Jess Banks, Jorge Garza-Vargas, Archit Kulkarni, Nikhil Srivastava

Found. Comput. Math., December, 2023

Wavelets based computational algorithms for multidimensional distributed order fractional differential equations with nonlinear source term.

Yashveer Kumar, Nikhil Srivastava, Aman Singh, Vineet Kumar Singh

Comput. Math. Appl., February, 2023

L3 approximation of Caputo derivative and its application to time-fractional wave equation-(I).

Nikhil Srivastava, Vineet Kumar Singh

Math. Comput. Simul., 2023

The Complexity of Diagonalization.

Nikhil Srivastava

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization.

Papri Dey, Ravi Kannan, Nick Ryder, Nikhil Srivastava

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

On Eigenvalue Gaps of Integer Matrices.

Aaron Abrams, Zeph Landau, Jamie Pommersheim, Nikhil Srivastava

CoRR, 2022

Global Convergence of Hessenberg Shifted QR II: Numerical Stability.

Jess Banks, Jorge Garza-Vargas, Nikhil Srivastava

CoRR, 2022

Global Convergence of Hessenberg Shifted QR III: Approximate Ritz Values via Shifted Inverse Iteration.

Jess Banks, Jorge Garza-Vargas, Nikhil Srivastava

CoRR, 2022

2021

Global Convergence of Hessenberg Shifted QR I: Dynamics.

Jess Banks, Jorge Garza-Vargas, Nikhil Srivastava

CoRR, 2021

Bit Complexity of Jordan Normal Form and Spectral Factorization.

Papri Dey, Ravi Kannan, Nick Ryder, Nikhil Srivastava

CoRR, 2021

Many nodal domains in random regular graphs.

Shirshendu Ganguly, Theo McKenzie, Sidhanth Mohanty, Nikhil Srivastava

CoRR, 2021

Support of closed walks and second eigenvalue multiplicity of graphs.

Theo McKenzie, Peter Michael Reichstein Rasmussen, Nikhil Srivastava

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020

Support of Closed Walks and Second Eigenvalue Multiplicity of Regular Graphs.

Theo McKenzie, Peter M. R. Rasmussen, Nikhil Srivastava

CoRR, 2020

Overlaps, Eigenvalue Gaps, and Pseudospectrum under real Ginibre and Absolutely Continuous Perturbations.

Jess Banks, Jorge Garza-Vargas, Archit Kulkarni, Nikhil Srivastava

CoRR, 2020

Wavelet approximation scheme for distributed order fractional differential equations.

Yashveer Kumar, Somveer Singh, Nikhil Srivastava, Aman Singh, Vineet Kumar Singh

Comput. Math. Appl., 2020

An efficient and stable Lagrangian matrix approach to Abel integral and integro-differential equations.

Rahul Kumar Maurya, Vinita Devi, Nikhil Srivastava, Vineet Kumar Singh

Appl. Math. Comput., 2020

2019

High-girth near-Ramanujan graphs with localized eigenvectors.

Noga Alon, Shirshendu Ganguly, Nikhil Srivastava

CoRR, 2019

Gaussian Regularization of the Pseudospectrum and Davies' Conjecture.

Jess Banks, Archit Kulkarni, Satyaki Mukherjee, Nikhil Srivastava

CoRR, 2019

Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones.

Prasad Raghavendra, Nick Ryder, Nikhil Srivastava, Benjamin Weitz

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Optimal Lower Bounds for Sketching Graph Cuts.

Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes.

Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava

SIAM J. Comput., 2018

On Non-localization of Eigenvectors of High Girth Graphs.

Shirshendu Ganguly, Nikhil Srivastava

CoRR, 2018

A matrix expander Chernoff bound.

Ankit Garg, Yin Tat Lee, Zhao Song, Nikhil Srivastava

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification.

Nikhil Srivastava, Luca Trevisan

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Localization of Electrical Flows.

Aaron Schild, Satish Rao, Nikhil Srivastava

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Approximating the Largest Root and Applications to Interlacing Families.

Nima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Matrix Concentration for Expander Walks.

Ankit Garg, Nikhil Srivastava

CoRR, 2017

Group Synchronization on Grids.

Emmanuel Abbe, Laurent Massoulié, Andrea Montanari, Allan Sly, Nikhil Srivastava

CoRR, 2017

Real Stability Testing.

Prasad Raghavendra, Nick Ryder, Nikhil Srivastava

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2013

Spectral sparsification of graphs: theory and algorithms.

Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava, Shang-Hua Teng

Commun. ACM, 2013

A new approach to computing maximum flows using electrical flows.

Yin Tat Lee, Satish Rao, Nikhil Srivastava

Proceedings of the Symposium on Theory of Computing Conference, 2013

Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees.

Adam Marcus, Daniel A. Spielman, Nikhil Srivastava

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

Twice-Ramanujan Sparsifiers.

Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava

SIAM J. Comput., 2012

Voting with rubber bands, weights, and strings.

Davide P. Cervone, Ronghua Dai, Daniel Gnoutcheff, Grant Lanterman, Andrew Mackenzie, Ari Morse, Nikhil Srivastava, William S. Zwicker

Math. Soc. Sci., 2012

Graph densification.

Moritz Hardt, Nikhil Srivastava, Madhur Tulsiani

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Zero-One Rounding of Singular Vectors.

Amit Deshpande, Ravindran Kannan, Nikhil Srivastava

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Graph Sparsification by Effective Resistances.

Daniel A. Spielman, Nikhil Srivastava

SIAM J. Comput., 2011

2007

On the longest path algorithm for reconstructing trees from distance matrices.

Lev Reyzin, Nikhil Srivastava

Inf. Process. Lett., 2007

Learning and Verifying Graphs Using Queries with a Focus on Edge Counting.

Lev Reyzin, Nikhil Srivastava

Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2005

Tight bounds on plurality.

Nikhil Srivastava, Alan D. Taylor

Inf. Process. Lett., 2005