On anonymous paths local certification has a gap between O(1) and Θ(log log n), and a natural property with optimal Θ(log log n) certificates exists; on cycles the gap is between O(1) and Θ(log n).
Introduction to Distributed Self-Stabilizing Algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Complexity landscape for local certification
On anonymous paths local certification has a gap between O(1) and Θ(log log n), and a natural property with optimal Θ(log log n) certificates exists; on cycles the gap is between O(1) and Θ(log n).