L. Devroye, A note on the probabilistic analysis of patricia trees. Random Struct, Algorithms, vol.3, issue.2, pp.203-214, 1992.

H. M. James-allen-fill, W. Mahmoud, and . Szpankowski, On the distribution for the duration of a randomized leader election algorithm, Ann. Appl. Probab, vol.6, pp.1260-1283, 1996.

S. Janson and W. Szpankowski, Analysis of an asymmetric leader election algorithm, Electr. J. Comb, vol.4, issue.1, 1997.
URL : https://hal.archives-ouvertes.fr/inria-00073602

C. Knessl, A Note on the Asymptotic Behavior of the Depth of Tries, Algorithmica, vol.22, issue.4, pp.547-560, 1998.
DOI : 10.1007/PL00009239

G. Louchard and H. Prodinger, The Asymmetric Leader Election Algorithm: Another Approach, Annals of Combinatorics, vol.3, issue.1-3, pp.449-478, 2009.
DOI : 10.1007/s00026-009-0004-2

C. Martinez, G. Louchard, and H. Prodinger, The swedish leader election protocol: Analysis and variations, ANALCO, pp.127-134, 2011.

H. Prodinger, How to select a loser, Discrete Mathematics, vol.120, issue.1-3, pp.149-159, 1993.
DOI : 10.1016/0012-365X(93)90572-B