M. Aigner and G. Ziegler, Proofs from THE BOOK, vol.274, 2010.

D. Angluin, Local and global properties in networks of processes, Proc. 12th Symposium on Theory of Computing (STOC'80), pp.82-93, 1980.

Z. Aghazadeh, D. Imbs, M. Raynal, G. Taubenfeld, and W. Ph, Optimal memoryanonymous symmetric deadlock-free mutual exclusion, Proc. 38th ACM Symposium on Principles of Distributed Computing (PODC'19), p.10, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02394246

H. Attiya, A. Gorbach, and S. Moran, Computing in totally anonymous asynchronous sharedmemory systems, Information and Computation, vol.173, issue.2, pp.162-183, 2002.

F. Bonnet and M. Raynal, Anonymous asynchronous systems: the case of failure detectors, Distributed Computing, vol.26, issue.3, pp.141-158, 2013.
URL : https://hal.archives-ouvertes.fr/inria-00452799

Z. Bouzid, M. Raynal, and P. Sutra, Anonymous obstruction-free (n, k)-set agreement with (n ? k + 1) atomic read/write registers, Distributed Computing, vol.31, issue.2, pp.99-117, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01680833

C. Delporte, H. Fauconnier, E. Gafni, and L. L. , Adaptive register allocation with a linear number of registers, Proc. 27th Int'l Symposium on Distributed Computing (DISC'13), Springer LNCS 8205, pp.269-283, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00922425

E. W. Dijkstra, Solution of a problem in concurrent programming control, Communications of the ACM, vol.8, issue.9, p.569, 1965.

E. W. Dijkstra, Some beautiful arguments using mathematical induction, Algorithmica, vol.13, issue.1, pp.1-8, 1980.

V. K. Garg and J. Ghosh, Symmetry in spite of hierarchy, Proc. 10th Int'l Conference on Distributed Computing Systems (ICDCS'90), pp.4-11, 1990.

R. Guerraoui and E. Ruppert, Anonymous and fault-tolerant shared-memory computations, Distributed Computing, vol.20, pp.165-177, 2007.

R. E. Johnson and F. B. Schneider, Symmetry and similarity in distributed systems, Proc.4th ACM Symposium on Principles of Distributed Computing (PODC'85), pp.13-22, 1985.

L. Lamport, On interprocess communication, Part I: basic formalism, Distributed Computing, vol.1, issue.2, pp.77-85, 1986.

S. Navlakha and Z. Bar-joseph, Algorithms in nature: the convergence of systems biology and computational thinking, Molecular systems biology, vol.7, issue.546, pp.1-11, 2011.

S. Navlakha and Z. Bar-joseph, Distributed information processing in biological and computational systems, Communications of the ACM, vol.58, issue.1, pp.94-102, 2015.

A. J. Perlis, Epigrams on programming, ACM SIGPLAN Notices, vol.17, issue.1, pp.7-13, 1982.

G. L. Peterson, Myths about the mutual exclusion problem, Information Processing Letters, vol.12, issue.3, pp.115-116, 1981.

S. Rashid, G. Taubenfeld, and Z. Bar-joseph, Genome wide epigenetic modifications as a shared memory consensus, 2018.

M. Raynal, Concurrent programming: algorithms, principles and foundations, vol.515, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00922217

M. Raynal, Fault-tolerant message-passing distributed systems: an algorithmic approach, vol.492, 2018.

M. Raynal and J. Cao, Anonymity in distributed read/write systems: an introductory survey, Proc. 6th Int'l Conference on Networked Systems (NETYS'18), Springer LNCS 11028, pp.122-140, 2018.

G. Taubenfeld, Synchronization algorithms and concurrent programming. Pearson Education/Prentice Hall, 423 pages, pp.0-131, 2006.

G. Taubenfeld, Coordination without prior agreement, Proc. 36th ACM Symposium on Principles of Distributed Computing (PODC'17), pp.325-334, 2017.

M. Yamashita and T. Kameda, Computing on anonymous networks: Part I -characterizing the solvable cases, IEEE Transactions on Parallel Distributed Systems, vol.7, issue.1, pp.69-89, 1996.