Leader election in complete networks

DOI10.1145/135419.135457zbMath1369.68047OpenAlexW2092163107WikidataQ130994394 ScholiaQ130994394MaRDI QIDQ5348850

Gurdip Singh

Publication date: 21 August 2017

Published in: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/135419.135457

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

Related Items (4)

On the impact of sense of direction on message complexity ⋮ Improved Tradeoffs for Leader Election ⋮ Hundreds of impossibility results for distributed computing ⋮ Real-time leader election

This page was built for publication: Leader election in complete networks