Distributed elections in an archimedean ring of processors

Electing a leader in a synchronous ring

Journal of the ACM (JACM)

The effects of link failures on computations in asynchronous rings

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing

Lower bounds on communication complexity in distributed computer networks

Journal of the ACM (JACM)

A modular technique for the design of efficient distributed leader finding algorithms

ACM Transactions on Programming Languages and Systems (TOPLAS)

Self-stabilizing symmetry breaking in constant-space (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing

Auction allocation of computing resources

Communications of the ACM

Improvements in the time complexity of two message-optimal election algorithms

Proceedings of the fourth annual ACM symposium on Principles of distributed computing

Optimal Resilient Distributed Algorithms for Ring Election

IEEE Transactions on Parallel and Distributed Systems

Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity

IEEE Transactions on Parallel and Distributed Systems

On the complexity of computation in the presence of link failures: the case of a ring

Distributed Computing

The Asynchronous Bounded-Cycle Model

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems

The Asynchronous Bounded-Cycle model

Theoretical Computer Science

Proving atomicity: an assertional approach

DISC'05 Proceedings of the 19th international conference on Distributed Computing