Geodesic
A probabilistic analysis of a leader election algorithm
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (2006).

Voir la notice de l'article provenant de la source Episciences

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]. 
@article{DMTCS_2006_special_252_a40,
     author = {Mohamed, Hanene},
     title = {A probabilistic analysis of a leader election algorithm},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities},
     year = {2006},
     doi = {10.46298/dmtcs.3516},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3516/}
}
TY  - JOUR
AU  - Mohamed, Hanene
TI  - A probabilistic analysis of a leader election algorithm
JO  - Discrete mathematics & theoretical computer science
PY  - 2006
VL  - DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3516/
DO  - 10.46298/dmtcs.3516
LA  - en
ID  - DMTCS_2006_special_252_a40
ER  - 
%0 Journal Article
%A Mohamed, Hanene
%T A probabilistic analysis of a leader election algorithm
%J Discrete mathematics & theoretical computer science
%D 2006
%V DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3516/
%R 10.46298/dmtcs.3516
%G en
%F DMTCS_2006_special_252_a40
Mohamed, Hanene. A probabilistic analysis of a leader election algorithm. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (2006). doi : 10.46298/dmtcs.3516. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3516/

Cité par Sources :