Singularly optimal randomized leader election

DOI10.4230/lipics.disc.2020.22zbMATH Open1540.68037MaRDI QIDQ6535020

William K. jun. Moses, Shay Kutten, Gopal Pandurangan, David Peleg

Publication date: 2 November 2023

zbMATH Keywords

randomized algorithmsasynchronous systemsleader electioncomplete networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sublinear bounds for randomized leader election
• Elections in anonymous networks
• Optimal lower bounds for some distributed algorithms for a complete network of processors
• Randomized leader election
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Design and Analysis of Distributed Algorithms
• A trade-off between information and communication in broadcast protocols
• Scalable leader election
• Low Communication Self-stabilization through Randomization
• The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Leader Election in Complete Networks
• Distributed Computing: A Locality-Sensitive Approach
• A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees
• A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities
• Efficient leader election using sense of direction
• Round- and Message-Optimal Distributed Graph Algorithms
• Probabilistic quorum systems
• On the Complexity of Universal Leader Election
• Efficient distributed approximation algorithms via probabilistic tree embeddings

Related Items (4)

Unnamed Item ⋮ Leader election in SINR model with arbitrary power control ⋮ Leader election in the presence of n-1 initial failures ⋮ On the Complexity of Universal Leader Election

This page was built for publication: Singularly optimal randomized leader election