Improved Tradeoffs for Leader Election

DOI10.1145/3583668.3594576arXiv2301.08235OpenAlexW4380875831MaRDI QIDQ6202275

Shay Kutten, Unnamed Author, Ming Ming Tan, Peter Robinson

Publication date: 26 March 2024

Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.08235

zbMATH Keywords

lower bounddistributed algorithmleader election

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Sublinear bounds for randomized leader election
• Elections in anonymous networks
• Randomized leader election
• Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication
• Leader Election and Shape Formation with Self-organizing Programmable Matter
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• A trade-off between information and communication in broadcast protocols
• Electing a leader in a synchronous ring
• Distributed Computing: A Locality-Sensitive Approach
• Leader election in complete networks
• Computation in networks of passively mobile finite-state sensors
• On the Complexity of Universal Leader Election

This page was built for publication: Improved Tradeoffs for Leader Election