A probabilistic analysis of a leader election algorithm
| dc.creator | Mohamed, Hanene | |
| dc.date | 2007-02-09 | |
| dc.date.accessioned | 2026-07-07T07:45:57Z | |
| dc.date.available | 2026-07-07T07:45:57Z | |
| dc.description | 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]. | |
| dc.identifier | https://arxiv.org/abs/cs/0702056 | |
| dc.identifier | http://arxiv.org/abs/cs/0702056 | |
| dc.identifier | Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (2006) 225-236 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/123674 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | A probabilistic analysis of a leader election algorithm | |
| dc.type | text |