Fast leader election in anonymous rings with bounded expected delay
From MaRDI portal
(Redirected from Publication:1944153)
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 1304100 (Why is no real title available?)
- A survey of formal methods applied to leader election in IEEE 1394
- 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
- Complexity of network synchronization
- Decentralized extrema-finding in circular configurations of processors
- Electing a leader in a synchronous ring
- Fast leader election in anonymous rings with bounded expected delay
- Introduction to Distributed Algorithms
- Lower Bounds for Distributed Maximum-Finding Algorithms
- New lower bound techniques for distributed leader finding and other problems on rings of processors
- Symmetry breaking in distributed networks
This page was built for publication: Fast leader election in anonymous rings with bounded expected delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944153)