Simple and efficient leader election in the full information model

DOI10.1145/195058.195141zbMath1344.68033OpenAlexW2065626264MaRDI QIDQ2817614

Umesh V. Vazirani, Rafail Ostrovsky, Sridhar Rajagopalan

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (4)

High entropy random selection protocols ⋮ Stochastic coalescence in logarithmic time ⋮ Unnamed Item ⋮ Perfect information leader election in \(\log^*n+O(1)\) rounds

This page was built for publication: Simple and efficient leader election in the full information model