Parallel algorithm for matroid basis computation with O(n^{1/3} log^{1/3} n) round complexity, nearly matching the KUW lower bound.
Karger , editor =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces a stochastic connectivity model combining typed dependency graphs, replication maps, probability measures, and success predicates for microservice availability analysis reconstructible from traces.
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.
-
Stochastic Connectivity as the Foundation of a Runtime Model for Microservice Availability Analysis
Introduces a stochastic connectivity model combining typed dependency graphs, replication maps, probability measures, and success predicates for microservice availability analysis reconstructible from traces.