Nikhil Srivastava

Orcid: 0000-0002-9688-3412

According to our database1, Nikhil Srivastava authored at least 41 papers between 2005 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time.
Found. Comput. Math., December, 2023

Wavelets based computational algorithms for multidimensional distributed order fractional differential equations with nonlinear source term.
Comput. Math. Appl., February, 2023

L3 approximation of Caputo derivative and its application to time-fractional wave equation-(I).
Math. Comput. Simul., 2023

The Complexity of Diagonalization.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
On Eigenvalue Gaps of Integer Matrices.
CoRR, 2022

Global Convergence of Hessenberg Shifted QR II: Numerical Stability.
CoRR, 2022

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

A Spectral Approach to Polytope Diameter.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Global Convergence of Hessenberg Shifted QR I: Dynamics.
CoRR, 2021

Bit Complexity of Jordan Normal Form and Spectral Factorization.
CoRR, 2021

Many nodal domains in random regular graphs.
CoRR, 2021

Support of closed walks and second eigenvalue multiplicity of graphs.
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.
CoRR, 2020

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

Wavelet approximation scheme for distributed order fractional differential equations.
Comput. Math. Appl., 2020

An efficient and stable Lagrangian matrix approach to Abel integral and integro-differential equations.
Appl. Math. Comput., 2020

2019
High-girth near-Ramanujan graphs with localized eigenvectors.
CoRR, 2019

Gaussian Regularization of the Pseudospectrum and Davies' Conjecture.
CoRR, 2019

Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Optimal Lower Bounds for Sketching Graph Cuts.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes.
SIAM J. Comput., 2018

On Non-localization of Eigenvectors of High Girth Graphs.
CoRR, 2018

A matrix expander Chernoff bound.
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.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Localization of Electrical Flows.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Approximating the Largest Root and Applications to Interlacing Families.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Matrix Concentration for Expander Walks.
CoRR, 2017

Group Synchronization on Grids.
CoRR, 2017

Real Stability Testing.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2014
Twice-Ramanujan Sparsifiers.
SIAM Rev., 2014

2013
Spectral sparsification of graphs: theory and algorithms.
Commun. ACM, 2013

A new approach to computing maximum flows using electrical flows.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Voting with rubber bands, weights, and strings.
Math. Soc. Sci., 2012

Graph densification.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Zero-One Rounding of Singular Vectors.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Graph Sparsification by Effective Resistances.
SIAM J. Comput., 2011

2007
On the longest path algorithm for reconstructing trees from distance matrices.
Inf. Process. Lett., 2007

Learning and Verifying Graphs Using Queries with a Focus on Edge Counting.
Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2005
Tight bounds on plurality.
Inf. Process. Lett., 2005


  Loading...