Skip to Main content Skip to Navigation
New interface
Conference papers

A probabilistic analysis of a leader election algorithm

Hanene Mohamed 1 
Abstract : 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].
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, August 17, 2015 - 2:26:07 PM
Last modification on : Friday, January 21, 2022 - 3:14:27 AM
Long-term archiving on: : Wednesday, November 18, 2015 - 12:11:46 PM


Publisher files allowed on an open archive




Hanene Mohamed. A probabilistic analysis of a leader election algorithm. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.225-236, ⟨10.46298/dmtcs.3516⟩. ⟨hal-00130117v2⟩



Record views


Files downloads