For any 2≤ρ≤√n, a new protocol solves self-stabilizing ranking in O(n/ρ·logρ) expected time with 2^{2ρlg^2ρ+O(logn)} states, the first to combine sublinear time with polynomial states.
Fast computation by population protocols with a leader
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
For any 2≤ρ≤√n, a new protocol solves self-stabilizing ranking in O(n/ρ·logρ) expected time with 2^{2ρlg^2ρ+O(logn)} states, the first to combine sublinear time with polynomial states.