On the complexity of universal leader election

DOI10.1145/2484239.2484274zbMath1323.68559OpenAlexW2011668511MaRDI QIDQ5176087

Gopal Pandurangan, Peter Robinson, Shay Kutten, Amitabh Trehan, David Peleg

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://pureadmin.qub.ac.uk/ws/files/17451767/Pure_Jacm_Version.pdf

zbMATH Keywords

lower bounddistributed algorithmleader election

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items

Communication costs in a geometric communication network ⋮ Unnamed Item