A probabilistic analysis of a leader election algorithm
<|reference_start|>A probabilistic analysis of a leader election algorithm: A {\em 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 {\em cost} of the algorithm, i.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].<|reference_end|>
@article{mohamed2007a,
    title={A probabilistic analysis of a leader election algorithm},
    author={Hanene Mohamed (INRIA Rocquencourt)},
    journal={Fourth Colloquium on Mathematics and Computer Science Algorithms,
  Trees, Combinatorics and Probabilities (2006) 225-236},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0702056},
    primaryClass={cs.DS}
}