Analysis of Resparsification
Not on the map. Why?
Abstract (arXiv)
We show that schemes for sparsifying matrices based on iteratively resampling rows yield guarantees matching classic 'offline' sparsifiers (see e.g. Spielman and Srivastava [STOC 2008]). In particular, this gives a formal analysis of a scheme very similar to the one proposed by Kelner and Levin [TCS 2013].
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 26 May 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.