Randomized LOCAL algorithm computes 2-ruling sets in O(log log n) rounds w.h.p. on graphs with arboricity O(log log n), nearly matching lower bounds and exponentially improving prior combinations of results.
Massively Parallel Ruling Set Made Deterministic , booktitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
First deterministic sublogarithmic-round spanner and APSP algorithms in linear, sublinear, and near-linear MPC plus Congested Clique via derandomized hitting sets.
citing papers explorer
-
Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity
Randomized LOCAL algorithm computes 2-ruling sets in O(log log n) rounds w.h.p. on graphs with arboricity O(log log n), nearly matching lower bounds and exponentially improving prior combinations of results.
-
Deterministic Distance Approximation in MPC via Improved Hitting Sets
First deterministic sublogarithmic-round spanner and APSP algorithms in linear, sublinear, and near-linear MPC plus Congested Clique via derandomized hitting sets.