Presents a self-stabilizing C-counting algorithm that stabilizes in asymptotically optimal O(f+1) rounds with message size O(log² n + log C) and amortized bit complexity O(n(f log C + log² n)).
Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Early-Stabilizing Counting
Presents a self-stabilizing C-counting algorithm that stabilizes in asymptotically optimal O(f+1) rounds with message size O(log² n + log C) and amortized bit complexity O(n(f log C + log² n)).