Sublinear Message Bounds for Randomized Agreement

DOI10.1145/3212734.3212751zbMath1428.68057OpenAlexW2810304763MaRDI QIDQ5197696

Gopal Pandurangan, Anisur Rahaman Molla, John E. Augustine

Publication date: 19 September 2019

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

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

zbMATH Keywords

randomized algorithmdistributed algorithmagreementleader electionshared randomnessglobal coin

Mathematics Subject Classification ID

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

Related Items

Improved deterministic leader election in diameter-two networks, Fault-tolerant graph realizations in the congested clique