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]

Authors

Arnaud Casteigts

This author has not been identified. Look up 'Arnaud Casteigts' in Google

Yves Métivier

This author has not been identified. Look up 'Yves Métivier' in Google

J. M. Robson

This author has not been identified. Look up 'J. M. Robson' in Google

Akka Zemmari

This author has not been identified. Look up 'Akka Zemmari' in Google