B. S. Chlebus, Randomized Communication in Radio Networks, Handbook of randomized computing, pp.401-456, 2001.
DOI : 10.1007/978-1-4615-0013-1_11

G. Fayolle, P. Flajolet, and M. Hofri, On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel, Advances in Applied Probability, vol.19, issue.02, pp.441-472, 1986.
DOI : 10.1109/TIT.1985.1057014
URL : https://hal.archives-ouvertes.fr/inria-00076429

J. A. Fill, H. M. Mahmoud, and W. Szpankowski, On the distribution for the duration of a randomized leader election algorithm, The Annals of Applied Probability, vol.6, issue.4, pp.1260-1283, 1996.
DOI : 10.1214/aoap/1035463332

P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoretical Computer Science, vol.144, issue.1-2, pp.3-58, 1995.
DOI : 10.1016/0304-3975(95)00002-E
URL : https://hal.archives-ouvertes.fr/inria-00074307

S. Janson and W. Szpankowski, Analysis of an asymmetric leader election algorithm, Electron. J. Combin, vol.4, issue.16, p.pp, 1997.
URL : https://hal.archives-ouvertes.fr/inria-00073602

C. Lavault and G. Louchard, Asymptotic analysis of a leader election algorithm. submitted to Theoretical Computer Science, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00084608

C. Lavault, J. Marckert, and V. Ravelomanana, Quasi-optimal leader election algorithms in radio networks with log-logarithmic awake time-slots, 10th International Conference on Telecommunications, 2003. ICT 2003., pp.1113-1119, 2003.
DOI : 10.1109/ICTEL.2003.1191592

N. Malpani, J. Welch, and N. Vaidya, Leader election algorithms for mobile ad hoc networks, Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications , DIALM '00, 2000.
DOI : 10.1145/345848.345871

P. Mathys and P. Flajolet, Q-ary collision resolution algorithms in random-access systems with free or blocked channel access, IEEE Trans. Inform. Theory, issue.2, pp.31217-243, 1985.
URL : https://hal.archives-ouvertes.fr/inria-00076223

H. Mohamed and P. Robert, A probabilistic analysis of some tree algorithms, The Annals of Applied Probability, vol.15, issue.4, pp.2445-2471, 2005.
DOI : 10.1214/105051605000000494
URL : https://hal.archives-ouvertes.fr/inria-00070586

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

P. Robert, On the asymptotic behavior of some algorithms. Random Structures Algorithms, pp.235-250, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00004119

M. D. Ward and W. Szpankowski, Analysis of a randomized selection algorithm motiveted by the lz'77 scheme, Proc. of the First Workshop on Analytic Algorithmics and Combinatorics (ANALCO04), 2004.

D. E. Willard, Log-logarithmic protocols for resolving ethernet and semaphore conflicts, Proceedings of the sixteenth annual ACM symposium on Theory of computing , STOC '84, pp.512-521, 1984.
DOI : 10.1145/800057.808721