default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikhil Srivastava
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]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: 73-103 (2023)- [j12]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): 1959-2047 (2023) - [j11]Nikhil Srivastava, Vineet Kumar Singh:
L3 approximation of Caputo derivative and its application to time-fractional wave equation-(I). Math. Comput. Simul. 205: 532-557 (2023) - [c20]Papri Dey, Ravi Kannan, Nick Ryder, Nikhil Srivastava:
Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization. ITCS 2023: 42:1-42:18 - [c19]Nikhil Srivastava:
The Complexity of Diagonalization. ISSAC 2023: 1-6 - [i24]Nikhil Srivastava:
The Complexity of Diagonalization. CoRR abs/2305.10575 (2023) - 2022
- [c18]Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava:
A Spectral Approach to Polytope Diameter. ITCS 2022: 108:1-108:22 - [i23]Jess Banks, Jorge Garza-Vargas, Nikhil Srivastava:
Global Convergence of Hessenberg Shifted QR III: Approximate Ritz Values via Shifted Inverse Iteration. CoRR abs/2205.06804 (2022) - [i22]Jess Banks, Jorge Garza-Vargas, Nikhil Srivastava:
Global Convergence of Hessenberg Shifted QR II: Numerical Stability. CoRR abs/2205.06810 (2022) - [i21]Aaron Abrams, Zeph Landau, Jamie Pommersheim, Nikhil Srivastava:
On Eigenvalue Gaps of Integer Matrices. CoRR abs/2212.07032 (2022) - 2021
- [c17]Theo McKenzie, Peter Michael Reichstein Rasmussen, Nikhil Srivastava:
Support of closed walks and second eigenvalue multiplicity of graphs. STOC 2021: 396-407 - [i20]Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava:
A Spectral Approach to Polytope Diameter. CoRR abs/2101.12198 (2021) - [i19]Shirshendu Ganguly, Theo McKenzie, Sidhanth Mohanty, Nikhil Srivastava:
Many nodal domains in random regular graphs. CoRR abs/2109.11532 (2021) - [i18]Papri Dey, Ravi Kannan, Nick Ryder, Nikhil Srivastava:
Bit Complexity of Jordan Normal Form and Spectral Factorization. CoRR abs/2109.13956 (2021) - [i17]Jess Banks, Jorge Garza-Vargas, Nikhil Srivastava:
Global Convergence of Hessenberg Shifted QR I: Dynamics. CoRR abs/2111.07976 (2021) - 2020
- [j10]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: 125005 (2020) - [j9]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): 1985-2017 (2020) - [c16]Jess Banks, Jorge Garza-Vargas, Archit Kulkarni, Nikhil Srivastava:
Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time. FOCS 2020: 529-540 - [i16]Jess Banks, Jorge Garza-Vargas, Archit Kulkarni, Nikhil Srivastava:
Overlaps, Eigenvalue Gaps, and Pseudospectrum under real Ginibre and Absolutely Continuous Perturbations. CoRR abs/2005.08930 (2020) - [i15]Theo McKenzie, Peter M. R. Rasmussen, Nikhil Srivastava:
Support of Closed Walks and Second Eigenvalue Multiplicity of Regular Graphs. CoRR abs/2007.12819 (2020)
2010 – 2019
- 2019
- [c15]Prasad Raghavendra, Nick Ryder, Nikhil Srivastava, Benjamin Weitz:
Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones. SODA 2019: 2322-2332 - [c14]Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan:
Optimal Lower Bounds for Sketching Graph Cuts. SODA 2019: 2565-2569 - [i14]Jess Banks, Archit Kulkarni, Satyaki Mukherjee, Nikhil Srivastava:
Gaussian Regularization of the Pseudospectrum and Davies' Conjecture. CoRR abs/1906.11819 (2019) - [i13]Noga Alon, Shirshendu Ganguly, Nikhil Srivastava:
High-girth near-Ramanujan graphs with localized eigenvectors. CoRR abs/1908.03694 (2019) - [i12]Jess Banks, Jorge Garza-Vargas, Archit Kulkarni, Nikhil Srivastava:
Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time. CoRR abs/1912.08805 (2019) - 2018
- [j8]Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava:
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. SIAM J. Comput. 47(6): 2488-2509 (2018) - [c13]Nima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava:
Approximating the Largest Root and Applications to Interlacing Families. SODA 2018: 1015-1028 - [c12]Nikhil Srivastava, Luca Trevisan:
An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification. SODA 2018: 1306-1315 - [c11]Aaron Schild, Satish Rao, Nikhil Srivastava:
Localization of Electrical Flows. SODA 2018: 1577-1584 - [c10]Ankit Garg, Yin Tat Lee, Zhao Song, Nikhil Srivastava:
A matrix expander Chernoff bound. STOC 2018: 1102-1114 - [i11]Shirshendu Ganguly, Nikhil Srivastava:
On Non-localization of Eigenvectors of High Girth Graphs. CoRR abs/1803.08038 (2018) - 2017
- [c9]Prasad Raghavendra, Nick Ryder, Nikhil Srivastava:
Real Stability Testing. ITCS 2017: 5:1-5:15 - [i10]Ankit Garg, Nikhil Srivastava:
Matrix Concentration for Expander Walks. CoRR abs/1704.03864 (2017) - [i9]Nima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava:
Approximating the Largest Root and Applications to Interlacing Families. CoRR abs/1704.03892 (2017) - [i8]Emmanuel Abbe, Laurent Massoulié, Andrea Montanari, Allan Sly, Nikhil Srivastava:
Group Synchronization on Grids. CoRR abs/1706.08561 (2017) - [i7]Nikhil Srivastava, Luca Trevisan:
An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification. CoRR abs/1707.06364 (2017) - [i6]Aaron Schild, Satish Rao, Nikhil Srivastava:
Localization of Electrical Flows. CoRR abs/1708.01632 (2017) - [i5]Prasad Raghavendra, Nick Ryder, Nikhil Srivastava, Benjamin Weitz:
Exponential lower bounds on spectrahedral representations of hyperbolicity cones. CoRR abs/1711.11497 (2017) - [i4]Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan:
Optimal Lower Bounds for Sketching Graph Cuts. CoRR abs/1712.10261 (2017) - 2016
- [i3]Prasad Raghavendra, Nick Ryder, Nikhil Srivastava:
Real Stability Testing. CoRR abs/1610.00209 (2016) - 2015
- [c8]Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava:
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. FOCS 2015: 1358-1377 - 2014
- [j7]Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava:
Twice-Ramanujan Sparsifiers. SIAM Rev. 56(2): 315-334 (2014) - 2013
- [j6]Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava, Shang-Hua Teng:
Spectral sparsification of graphs: theory and algorithms. Commun. ACM 56(8): 87-94 (2013) - [c7]Adam Marcus, Daniel A. Spielman, Nikhil Srivastava:
Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees. FOCS 2013: 529-537 - [c6]Yin Tat Lee, Satish Rao, Nikhil Srivastava:
A new approach to computing maximum flows using electrical flows. STOC 2013: 755-764 - 2012
- [j5]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): 11-27 (2012) - [j4]Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava:
Twice-Ramanujan Sparsifiers. SIAM J. Comput. 41(6): 1704-1721 (2012) - [c5]Amit Deshpande, Ravindran Kannan, Nikhil Srivastava:
Zero-One Rounding of Singular Vectors. ICALP (1) 2012: 278-289 - [c4]Moritz Hardt, Nikhil Srivastava, Madhur Tulsiani:
Graph densification. ITCS 2012: 380-392 - 2011
- [j3]Daniel A. Spielman, Nikhil Srivastava:
Graph Sparsification by Effective Resistances. SIAM J. Comput. 40(6): 1913-1926 (2011)
2000 – 2009
- 2009
- [c3]Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava:
Twice-ramanujan sparsifiers. STOC 2009: 255-262 - 2008
- [c2]Daniel A. Spielman, Nikhil Srivastava:
Graph sparsification by effective resistances. STOC 2008: 563-568 - [i2]Daniel A. Spielman, Nikhil Srivastava:
Graph Sparsification by Effective Resistances. CoRR abs/0803.0929 (2008) - [i1]Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava:
Twice-Ramanujan Sparsifiers. CoRR abs/0808.0163 (2008) - 2007
- [j2]Lev Reyzin, Nikhil Srivastava:
On the longest path algorithm for reconstructing trees from distance matrices. Inf. Process. Lett. 101(3): 98-100 (2007) - [c1]Lev Reyzin, Nikhil Srivastava:
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting. ALT 2007: 285-297 - 2005
- [j1]Nikhil Srivastava, Alan D. Taylor:
Tight bounds on plurality. Inf. Process. Lett. 96(3): 93-95 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
