Y. Afek and Y. Matias, Elections in Anonymous Networks, Information and Computation, vol.113, issue.2, pp.312-330, 1994.
DOI : 10.1006/inco.1994.1075

D. Alistarh, K. Censor-hillel, and N. Shavit, Are lock-free concurrent algorithms practically wait-free?, Symposium on Theory of Computing, STOC 2014, pp.714-723, 2014.

D. Angluin, Local and global properties in networks of processors (Extended Abstract), Proceedings of the twelfth annual ACM symposium on Theory of computing , STOC '80, pp.82-93, 1980.
DOI : 10.1145/800141.804655

D. Angluin, J. Aspnes, M. Chan, H. Jiang, M. Fischer et al., Stably Computable Properties of Network Graphs, Distributed Computing in Sensor Systems, pp.63-74, 2005.
DOI : 10.1007/11502593_8

D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta, Computation in networks of passively mobile finite-state sensors, Distributed Computing, pp.235-253, 2006.

D. Angluin, J. Aspnes, and D. Eisenstat, Stably computable predicates are semilinear, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.292-299, 2006.
DOI : 10.1145/1146381.1146425

J. Aspnes, Fast deterministic consensus in a noisy environment, Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, PODC '00, pp.299-308, 2000.

J. Beauquier, P. Blanchard, and J. Burman, Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs, Principles of Distributed Systems -17th International Conference, OPODIS 2013 Proceedings, pp.38-52, 2013.
DOI : 10.1007/978-3-319-03850-6_4

URL : https://hal.archives-ouvertes.fr/hal-00867287

C. S. Calude and M. Zimand, Algorithmically independent sequences, Developments in Language Theory, 12th International Conference Proceedings, pp.183-195, 2008.

G. J. Chaitin, A Theory of Program Size Formally Identical to Information Theory, Journal of the ACM, vol.22, issue.3, pp.329-340, 1975.
DOI : 10.1145/321892.321894

J. Chalopin, Y. Métivier, and T. Morsellino, Enumeration and leader election in partially anonymous and multi-hop broadcast networks, Fundamenta Informaticae, vol.120, issue.1, pp.1-27, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00540222

Y. Emek, C. Pfister, J. Seidel, and R. Wattenhofer, Anonymous networks, Proceedings of the 2014 ACM symposium on Principles of distributed computing, PODC '14, pp.96-105, 2014.
DOI : 10.1145/2611462.2611478

L. J. Guibas and A. M. Odlyzko, String overlaps, pattern matching, and nontransitive games, Journal of Combinatorial Theory, Series A, vol.30, issue.2, pp.183-208, 1981.
DOI : 10.1016/0097-3165(81)90005-4

A. Itai and M. Rodeh, Symmetry breaking in distributive networks, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981), pp.150-158, 1981.
DOI : 10.1109/SFCS.1981.41

M. Li and P. M. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, Third Edition, Texts in Computer Science, 2008.

P. Martin-löf, The definition of random sequences, Information and Control, vol.9, issue.6, pp.602-619, 1966.
DOI : 10.1016/S0019-9958(66)80018-9

A. Mazurkiewicz, Distributed enumeration, Information Processing Letters, vol.61, issue.5, pp.233-239, 1997.
DOI : 10.1016/S0020-0190(97)00022-7

R. J. Solomonoff, A formal theory of inductive inference. Part I, Information and Control, vol.7, issue.1, pp.1-22, 1964.
DOI : 10.1016/S0019-9958(64)90223-2

R. J. Solomonoff, A formal theory of inductive inference. Part II, Information and Control, vol.7, issue.2, pp.224-254, 1964.
DOI : 10.1016/S0019-9958(64)90131-7

L. Staiger, The Kolmogorov complexity of infinite words, Theoretical Computer Science, vol.383, issue.2-3, pp.187-199, 2007.
DOI : 10.1016/j.tcs.2007.04.013

K. Tadaki, A generalization of Chaitin's halting probability $\Omega$ and halting self-similar sets, Hokkaido Mathematical Journal, vol.31, issue.1, pp.219-253, 2002.
DOI : 10.14492/hokmj/1350911778

K. Tadaki, Partial Randomness and Dimension of Recursively Enumerable Reals, Mathematical Foundations of Computer Science, pp.687-699, 2009.
DOI : 10.1070/RM1970v025n06ABEH001269