Fast leader election in anonymous rings with bounded expected delay

DOI10.1016/J.IPL.2011.06.003zbMATH Open1260.68029OpenAlexW2113469534MaRDI QIDQ1944153FDOQ1944153

Jörg Endrullis, Wan Fokkink, Rena Bakhshi, Jun Pang

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

distributed computinganalysis of algorithmsdesign of algorithms

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to Distributed 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
• Complexity of network synchronization
• Symmetry breaking in distributed networks
• Lower Bounds for Distributed Maximum-Finding Algorithms
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• New lower bound techniques for distributed leader finding and other problems on rings of processors
• Fast leader election in anonymous rings with bounded expected delay
• A survey of formal methods applied to leader election in IEEE 1394

Cited In (1)

• Fast leader election in anonymous rings with bounded expected delay

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)