Bit-optimal election in synchronous rings
From MaRDI portal
Publication:916342
DOI10.1016/0020-0190(90)90187-3zbMATH Open0703.68016DBLPjournals/ipl/BodlaenderT90OpenAlexW2013480356WikidataQ59568052 ScholiaQ59568052MaRDI QIDQ916342FDOQ916342
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
Recommendations
- scientific article; zbMATH DE number 4050990
- Improved bounds for electing a leader in a synchronous ring
- Towards optimal distributed election on chordal rings
- scientific article
- Time vs bits
- Sorting and election in anonymous asynchronous rings.
- The Bit Complexity of Randomized Leader Election on a Ring
- Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
- Asymptotically optimal election on weighted rings
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
Cites Work
- Electing a leader in a synchronous ring
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
- An improved algorithm for decentralized extrema-finding in circular configurations of processes
- Lower Bounds for Distributed Maximum-Finding Algorithms
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
- Title not available (Why is that?)
- Time vs bits
Cited In (7)
- Tight bounds for synchronous communication of information using bits and silence
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
- Asymptotically optimal election on weighted rings
- Title not available (Why is that?)
- On the Microscopic View of Time and Messages
- Anonymous wireless rings
- Improved bounds for electing a leader in a synchronous ring
This page was built for publication: Bit-optimal election in synchronous rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916342)
