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]
@article{CasteigtsMRZ19-0,
title = {Deterministic Leader Election Takes Θ(D+log n) Bit Rounds},
author = {Arnaud Casteigts and Yves Métivier and J. M. Robson and Akka Zemmari},
year = {2019},
doi = {10.1007/s00453-018-0517-3},
url = {https://doi.org/10.1007/s00453-018-0517-3},
researchr = {https://researchr.org/publication/CasteigtsMRZ19-0},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1901-1920},
}