Spyridon Antonakopoulos. Fast leader-election protocols with bounded cheaters edge. In Jon M. Kleinberg, editor, Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006. pages 187-196, ACM, 2006. [doi]
@inproceedings{Antonakopoulos06,
title = {Fast leader-election protocols with bounded cheaters edge},
author = {Spyridon Antonakopoulos},
year = {2006},
doi = {10.1145/1132516.1132544},
url = {http://doi.acm.org/10.1145/1132516.1132544},
tags = {protocol},
researchr = {https://researchr.org/publication/Antonakopoulos06},
cites = {0},
citedby = {0},
pages = {187-196},
booktitle = {Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006},
editor = {Jon M. Kleinberg},
publisher = {ACM},
isbn = {1-59593-134-1},
}