A new algorithm finds a matroid basis in tilde O(n to the 3/7) adaptive rounds via independence oracle.
Spielman and Shang
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
GSQUEAK produces spectrally accurate sparsifiers for graph Laplacians in a single-pass distributed streaming setting.
citing papers explorer
-
An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
A new algorithm finds a matroid basis in tilde O(n to the 3/7) adaptive rounds via independence oracle.
-
Improved large-scale graph learning through ridge spectral sparsification
GSQUEAK produces spectrally accurate sparsifiers for graph Laplacians in a single-pass distributed streaming setting.