3 search results - page 1 / 1 » Bit complexity of breaking and achieving symmetry in chains ... |
JACM
2008
14 years 10 months ago
2008
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
WDAG
2001
Springer
2001
Springer
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
15 years 2 months ago
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space c...
143
click to vote
PODC
2011
ACM
14 years 1 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...