D. Angluin, Local and global properties in networks of processors, Proceedings of the 12th Symposium on theory of computing, pp.82-93, 1980.

W. Feller, An introduction to probability theory and its applications, 1971.

A. Hibaoui, J. M. Robson, N. Saheb-djahromi, and A. Zemmari, Uniform election in polyominoids and trees. soumisàsoumis`soumisà, Discrete Applied Mathematics
URL : https://hal.archives-ouvertes.fr/hal-00451114

A. Hibaoui, N. Saheb-djahromi, and A. Zemmari, Polyominoids and uniform election, 17th Formal Power Series and Algebraic Combinatorics (FPSAC), 2005.
URL : https://hal.archives-ouvertes.fr/hal-00307795

A. Hibaoui, N. Saheb-djahromi, and A. Zemmari, A uniform probabilistic election algorithm in k-trees, 17th IMACS World Congress : Scientific Computation, Applied Mathematics and Simulation (IMACS), 2005.
URL : https://hal.archives-ouvertes.fr/hal-00307796

L. Lann, Distributed systems -towards a formal approach, IFIP Congress, pp.155-160, 1977.

Y. Métivier and N. Saheb, Probabilistic analysis of an election algorithm in a tree, Lecture Notes in Computer Science, vol.787, pp.234-245, 1994.
DOI : 10.1007/BFb0017485

Y. Métivier, N. Saheb-djahromi, and A. Zemmari, Locally guided randomized elections in trees: The totally fair case, Information and Computation, vol.198, issue.1, pp.40-55, 2005.
DOI : 10.1016/j.ic.2005.01.005

G. Tel, Introduction to distributed algorithms, 2000.
DOI : 10.1017/CBO9781139168724