Parallel algorithm for matroid basis computation with O(n^{1/3} log^{1/3} n) round complexity, nearly matching the KUW lower bound.
Hypergraph partitioning for sparse matrix-matrix multiplication
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
A new algorithm finds a matroid basis in tilde O(n to the 3/7) adaptive rounds via independence oracle.
GPU algorithm for hypergraph partitioning with size and distinct hyperedge constraints achieves 380x speedup and 1.2-2.0x better connectivity than sequential methods.
citing papers explorer
-
A Near-Optimal Parallel Algorithm for Finding Matroid Bases
Parallel algorithm for matroid basis computation with O(n^{1/3} log^{1/3} n) round complexity, nearly matching the KUW lower bound.
-
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.
-
Hypergraph Partitioning on GPU with Distinct Incident Hyperedges and Size Constraints
GPU algorithm for hypergraph partitioning with size and distinct hyperedge constraints achieves 380x speedup and 1.2-2.0x better connectivity than sequential methods.