pith. sign in

Title resolution pending

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.DC 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Early-Stabilizing Counting

cs.DC · 2026-05-18 · unverdicted · novelty 7.0

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)).

citing papers explorer

Showing 1 of 1 citing paper.

  • Early-Stabilizing Counting cs.DC · 2026-05-18 · unverdicted · none · ref 5

    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)).