Fast leader election in anonymous rings with bounded expected delay

DOI10.1016/j.ipl.2011.06.003zbMath1260.68029OpenAlexW2113469534MaRDI QIDQ1944153

Jörg Endrullis, Rena Bakhshi, Jun Pang, W. J. Fokkink

Publication date: 4 April 2013

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.06.003

zbMATH Keywords

analysis of algorithmsdesign of algorithmsdistributed computing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Related Items (1)

Fast leader election in anonymous rings with bounded expected delay

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New lower bound techniques for distributed leader finding and other problems on rings of processors
• Symmetry breaking in distributed networks
• Fast leader election in anonymous rings with bounded expected delay
• Complexity of network synchronization
• Lower Bounds for Distributed Maximum-Finding Algorithms
• Electing a leader in a synchronous ring
• Decentralized extrema-finding in circular configurations of processors
• 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
• Introduction to Distributed Algorithms

This page was built for publication: Fast leader election in anonymous rings with bounded expected delay