Parallel algorithm for matroid basis computation with O(n^{1/3} log^{1/3} n) round complexity, nearly matching the KUW lower bound.
Faster Matroid Intersection , booktitle =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Two polynomial-time algorithms are proposed for multilevel fair allocation under matroid-rank preferences, one generic with efficiency and fairness guarantees and one extending General Yankee Swap with efficiency guarantees and strong practical fairness.
JEDI is a generated benchmark suite converting SQL queries into Java Stream and imperative implementations to evaluate performance and identify efficient parallelization strategies.
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.
-
Multilevel Fair Allocation with Matroid-Rank Preferences
Two polynomial-time algorithms are proposed for multilevel fair allocation under matroid-rank preferences, one generic with efficiency and fairness guarantees and one extending General Yankee Swap with efficiency guarantees and strong practical fairness.
-
JEDI: Java Evaluation of Declarative and Imperative Queries
JEDI is a generated benchmark suite converting SQL queries into Java Stream and imperative implementations to evaluate performance and identify efficient parallelization strategies.