Deterministic Leader Election Takes Θ(D+log n) Bit Rounds

Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari. Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. Algorithmica, 81(5):1901-1920, 2019. [doi]

Abstract

Abstract is missing.