Bit-optimal election in synchronous rings

DOI10.1016/0020-0190(90)90187-3zbMath0703.68016OpenAlexW2013480356WikidataQ59568052 ScholiaQ59568052MaRDI QIDQ916342

Hans L. Bodlaender, Gerard Tel

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/16592

zbMATH Keywords

analysis and complexity of algorithmsbit optimal electionsynchronous rings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)

Related Items (5)

Improved bounds for electing a leader in a synchronous ring ⋮ Tight bounds for synchronous communication of information using bits and silence ⋮ Anonymous wireless rings ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ On the Microscopic View of Time and Messages

Cites Work

• Unnamed Item
• Lower Bounds for Distributed Maximum-Finding Algorithms
• Electing a leader in a synchronous ring
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• An improved algorithm for decentralized extrema-finding in circular configurations of processes
• Time vs bits

This page was built for publication: Bit-optimal election in synchronous rings