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; zbMATH DE number 176511
- 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
Cites work
- scientific article; zbMATH DE number 3750291 (Why is no real title available?)
- 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
- Electing a leader in a synchronous ring
- Lower Bounds for Distributed Maximum-Finding Algorithms
- Time vs bits
Cited in
(7)- On the microscopic view of time and messages
- 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
- scientific article; zbMATH DE number 176511 (Why is no real title available?)
- 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)
