Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\)

DOI10.1007/978-3-662-53426-7_2zbMath1393.68028OpenAlexW2346573302MaRDI QIDQ1660914

Akka Zemmari, Yves Métivier, Arnaud Casteigts, John Michael Robson

Publication date: 16 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-53426-7_2

Mathematics Subject Classification ID

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

Related Items (4)

Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ Impact of knowledge on election time in anonymous networks ⋮ Unnamed Item ⋮ Near-optimal knowledge-free resilient leader election

This page was built for publication: Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\)