Nikhil Srivastava
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2022–2023
on a stage with
- Hariharan Narayananonce
- Nick Ryderonce
- Papri Deyonce
all 5 in the filters
who talks about the same things
- Makrand Sinha5 talks
- Yuval Filmus9 talks
- Raghu Meka5 talks
- Utsab Ghosal2 talks
- Partha Mukhopadhyay2 talks
- Anindya De3 talks
| title | conference | date |
|---|---|---|
| Bit Complexity of Jordan Normal Form and Spectral Factorization | ITCS 2023 | 2023-01-10 |
Gives a concrete, polynomial‑time procedure that either computes a matrix polynomial spectral factor q (to error ε in coefficient norm) or certifies none… | ||
| A Spectral Approach to Polytope Diameter | ITCS 2022 | 2022-01-31 |
Constructs a weighted 1-skeleton from the Hessian of log-volume of the polar polytope, shows that Hessian has exactly one positive eigenvalue and decomposes as… | ||
| Gaussian Regularization of the Pseudospectrum and Numerical Linear Algebra | Concentration of Measure Phenomena | 2020-10-19 |
Shows that adding a small complex Gaussian regularizes nonnormal spectra: a Toeplitz example has Toeplitz n=100: κ≈10^30 but a tiny random perturbation yields… | ||
| Spectral Sparsification of Graphs | Workshop on Succinct Data Representations and Applications (Simons Institute Big Data 2013) | 2013-09-16 |
Claim: every weighted undirected graph admits a spectral sparsifier with about N log N / ε^2 edges that preserves the Laplacian quadratic form up to 1±ε… | ||
| nothing matches | ||