Improved bounds for electing a leader in a synchronous ring

DOI10.1007/BF02526036zbMath0868.68060MaRDI QIDQ1355728

Mark H. Overmars, Nicola Santoro

Publication date: 28 May 1997

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

distributed algorithmssynchronous ringsdistributed leader election

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

Tight bounds for synchronous communication of information using bits and silence ⋮ Leader election in well-connected graphs ⋮ On the Microscopic View of Time and Messages

Cites Work

• Bit-optimal election in synchronous rings
• New protocols for the election of a leader in a ring
• Electing a leader in a synchronous ring

This page was built for publication: Improved bounds for electing a leader in a synchronous ring