How To Elect a Leader Faster than a Tournament

DOI10.1145/2767386.2767420zbMath1333.68268arXiv1411.1001OpenAlexW2140004544MaRDI QIDQ2796273

Rati Gelashvili, Adrian Vladu, Dan Alistarh

Publication date: 23 March 2016

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

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

zbMATH Keywords

lower boundrandomized algorithmsasynchronousleader electionmessage-passingmessage complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (1)

Game-theoretic fairness meets multi-party protocols: the case of leader election

Cites Work

• Memorization and Association on a Realistic Neural Model
• Unnamed Item

This page was built for publication: How To Elect a Leader Faster than a Tournament