Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt et al., Atomic snapshots of shared memory, Journal of the ACM, vol.40, issue.4, pp.873-890, 1993.

M. Aguilera, A pleasant stroll through the land of infinitely many creatures, ACM SIGACT news, DC column, vol.35, issue.2, pp.36-59, 2004.

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

H. Attiya, R. Guerraoui, D. Hendler, and K. P. , The complexity of obstruction-free implementations, Journal of the ACM, vol.56, issue.4, p.33, 2009.

J. Aspnes and M. Herlihy, Fast randomized consensus using shared memory, Journal of Algorithms, vol.11, pp.441-461, 1990.
DOI : 10.1016/0196-6774(90)90021-6

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

E. Borowsky and E. Gafni, Generalized FLP impossibility result for t-resilient asynchronous computations, Proc. 25-th Annual ACM Symposium on Theory of Computing (STOC'93), pp.91-100, 1993.

E. Borowsky, E. Gafni, N. Lynch, and S. Rajsbaum, The BG distributed simulation algorithm, Distributed Computing, vol.14, issue.3, pp.127-146, 2001.

Z. Bouzid, M. Raynal, and P. Sutra, Anonymous obstruction-free (n, k)-set agreement with n ? k + 1 atomic read/write registers, Proc. 19th Int'l Conference on Principles of Distributed Systems (OPODIS'15), Leibnitz Int'l Proceedings in Informatics (LIPIcs), vol.46, pp.1-17, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01680833

A. Castañeda, S. Rajsbaum, and M. , Specifying concurrent problems: beyond linearizability and up to tasks, Proc. 29th Symposium on Distributed Computing (DISC'15), vol.9363, pp.420-435, 2015.

T. Chandra, V. Hadzilacos, and T. S. , The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996.

S. Chaudhuri, More choices allow more faults: set consensus problems in totally asynchronous systems, Information and Computation, vol.105, pp.132-158, 1993.

C. Delporte, H. Fauconnier, E. Gafni, and R. S. , Black art: obstruction-free k-set agreement with |MWMR registers| < |processes|, Proc. First Int'l Conference on Networked Systems (NETYS'13), pp.28-41, 2013.

C. Delporte-gallet and H. Fauconnier, Two consensus algorithms with atomic registers and failure detector ?, Proc. 10th Int'l Conference on Distributed Computing and Networking (ICDCN'09), vol.5408, pp.251-262, 2009.

C. Delporte, H. Fauconnier, P. Kuznetsov, and E. Ruppert, On the space complexity of set agreement, Proc. 34th Int'l Symposium on Principles of Distributed Computing (PODC'15), pp.271-280, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01251563

E. Fich, F. Luchangco, V. Moir, M. Shavit, and N. , Obstruction-free algorithms can be practically wait-free, Proc. 19th Int'l Symposium on Distributed Computing (DISC'05), vol.3724, pp.78-92, 2005.

M. J. Fischer, N. A. Lynch, and M. S. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985.

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Hard tasks for weak robots: the role of common knowledge in pattern formation by autonomous mobile robots, Proc. 10th Int'l Symposium on Algorithms and Computation (ISAAC'99), pp.93-102, 1999.

R. Friedman, A. Mostefaoui, S. Rajsbaum, and M. , Distributed agreement problems and their connection with error-correcting codes, IEEE Transactions on Computers, vol.56, issue.7, pp.865-875, 2007.

R. Gelashvili, Optimal space complexity of consensus for anonymous processes Proc. 29th Int'l Symposium on Distributed Computing (DISC'15), Springer LNCS 9363, pp.452-466, 2015.

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

M. P. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991.

M. P. Herlihy, V. Luchangco, and M. M. , Obstruction-free synchronization: double-ended queues as an example, Proc. 23th Int'l IEEE Conference on Distributed Computing Systems (ICDCS'03), pp.522-529, 2003.

M. P. Herlihy and N. Shavit, The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999.

M. P. Herlihy and N. Shavit, The art of multiprocessor programming, vol.508, 2008.

M. P. Herlihy and J. Wing, Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.463-492, 1990.

L. Lamport, Concurrent reading and writing, Communications of the ACM, vol.20, issue.11, pp.806-811, 1977.

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

M. C. Loui and H. H. Abu-amara, Memory requirements for agreement among unreliable asynchronous processes, of Advances in Computing Research, vol.4, pp.163-183, 1987.

M. Merritt and G. Taubenfeld, Computing with infinitely many processes, vol.233, pp.12-31, 2013.

G. L. Peterson, Concurrent reading while writing, ACM Transactions on Programming Languages and Systems, vol.5, pp.46-55, 1983.

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

M. Raynal and J. Stainer, From the ? and store-collect building blocks to efficient asynchronous consensus, Proc. 18th Int'l European Parallel Computing Conference (EUROPAR'12), vol.7484, pp.427-438, 2012.

M. Saks, N. Shavit, and H. Woll, Optimal time randomized consensus-making resilient algorithms fast in practice, Proc. 2nd ACM/SIAM Symposium on Discrete Algorithms (SODA'90), pp.351-362, 1991.

M. Saks and F. Zaharoglou, Wait-free k-Set agreement is impossible: the topology of public knowledge, SIAM Journal Computing, vol.29, issue.5, pp.1449-1483, 2000.

I. Suzuki and M. Yamashita, Distributed anonymous mobile robots, Proc. 3rd Int'l Colloquium on Structural Information and Communication Complexity (SIROCCO'96), pp.313-330, 1996.
DOI : 10.1137/s009753979628292x

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

G. Taubenfeld, Contention-sensitive data structure and algorithms, Proc. 23th Int'l Symposium on Distributed Computing (DISC'09), Springer LNCS 5805, pp.157-171, 2009.
DOI : 10.1016/j.tcs.2017.03.017
URL : http://www.faculty.idc.ac.il/gadi/MyPapers/2009T-contentionSensitive.pdf

M. Yamashita and T. Kameda, Computing on anonymous networks: Part II-decision and membership problems, IEEE Transactions on Parallel Distributed Systems, vol.7, issue.1, pp.90-96, 1996.
DOI : 10.1109/71.481600

N. Yanagisawa, Wait-free solvability of colorless takss in anonymous shared-memory model, Proc. 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'16), Springer LNCS 10083, pp.415-429, 2016.

L. Zhu, Brief announcement: tight space bounds for memoryless anonymous consensus, Proc. 29th Symposium on Distributed Computing (DISC'15), Springer LNCS 9363, pp.665-666, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01207887

L. Zhu, A Tight space bound for consensus, Proc. 48th ACM Symposium on Theory of Computing (STOC'16), pp.345-350, 2016.
DOI : 10.1145/2897518.2897565