Improved deterministic leader election in diameter-two networks
From MaRDI portal
Publication:6057346
DOI10.1007/978-3-031-30448-4_23arXiv2302.11207MaRDI QIDQ6057346
No author found.
Publication date: 4 October 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.11207
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sublinear bounds for randomized leader election
- Optimal lower bounds for some distributed algorithms for a complete network of processors
- The complexity of leader election in diameter-two networks
- Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
- Design and Analysis of Distributed Algorithms
- Scalable leader election
- The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Distributed Computing: A Locality-Sensitive Approach
- Fair Leader Election for Rational Agents in Asynchronous Rings and Networks
- Leader Election in Well-Connected Graphs
- Sublinear Message Bounds for Randomized Agreement
- On the Complexity of Universal Leader Election
- Efficient distributed approximation algorithms via probabilistic tree embeddings
