Hanene Mohamed

A probabilistic analysis of a leader election algorithm
dmtcs:3516 
Discrete Mathematics & Theoretical Computer Science,
January 1, 2006,
DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities

https://doi.org/10.46298/dmtcs.3516
A probabilistic analysis of a leader election algorithmArticle
Authors: Hanene Mohamed ^{1}
NULL
Hanene Mohamed
1 Networks, Algorithms and Probabilities
A leader election algorithm is an elimination process that divides recursively into tow subgroups an initial group of n items, eliminates one subgroup and continues the procedure until a subgroup is of size 1. In this paper the biased case is analyzed. We are interested in the cost of the algorithm e. the number of operations needed until the algorithm stops. Using a probabilistic approach, the asymptotic behavior of the algorithm is shown to be related to the behavior of a hitting time of two random sequences on [0,1].
Guy Louchard;Helmut Prodinger, 2009, The Asymmetric Leader Election Algorithm: Another Approach, Annals of Combinatorics, 12, 4, pp. 449478, 10.1007/s0002600900042.