Y. Afek, A. Morrison, and G. Wertheim, From bounded to unbounded concurrency objects and back, Proc. of the 30th Annual ACM Symposium on Principles of Distributed Computing, pp.119-128, 2011.

K. Marcos and . Aguilera, A pleasant stroll through the land of infinitely many creatures, ACM Sigact News, vol.35, pp.36-59, 2004.

H. Attiya, A. Bar-noy, D. Dolev, D. Peleg, and R. Reischuk, Renaming in an asynchronous environment, J. ACM, vol.37, pp.524-548, 1990.

G. Bonin, A. Mostéfaoui, and M. Perrin, Wait-Free Universality of Consensus in the Infinite Arrival Model, International Symposium on Distributed Computing (DISC), 2019.
URL : https://hal.archives-ouvertes.fr/hal-02279627

K. Censor-hillel, E. Petrank, and S. Timnat, Help!. In Proc. of the ACM Symposium on Principles of Distributed Computing, pp.241-250, 2015.

F. Ellen, R. Gelashvili, N. Shavit, and L. Zhu, A complexity-based hierarchy for multiprocessor synchronization, Proc. of the ACM Symposium on Principles of Distributed Computing, pp.289-298, 2016.

I. Filipovi?, O. Peter, N. Hearn, H. Rinetzky, and . Yang, Abstraction for concurrent objects, Theoretical Computer Science, vol.411, pp.4379-4398, 2010.

M. J. Fischer, N. A. Lynch, and M. Paterson, Impossibility of Distributed Consensus with One Faulty Process, J. ACM, vol.32, pp.374-382, 1985.

E. Gafni, M. Merritt, and G. Taubenfeld, The concurrency hierarchy, and algorithms for unbounded concurrency, Proc. of the 20th ACM symposium on Principles of distributed computing, pp.161-169, 2001.

M. Herlihy, Wait-free synchronization, ACM TOPLAS, vol.13, pp.124-149, 1991.

M. Herlihy, S. Rajsbaum, and M. Raynal, Power and limits of distributed computing shared memory models, Theor. Comput. Sci, vol.509, 2013.

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

M. Herlihy and J. M. Wing, Linearizability: A Correctness Condition for Concurrent Objects, ACM TOPLAS, vol.12, pp.463-492, 1990.

C. Michael, . Loui, H. Hosame, and . Abu-amara, Memory Requirements for Agreement Among Unreliable Asynchronous Processes. Parallel and Distributed Computing, vol.4, pp.163-183, 1987.

A. Mostefaoui, M. Raynal, and F. Tronel, From binary consensus to multivalued consensus in asynchronous message-passing systems, Inform. Process. Lett, vol.73, pp.207-212, 2000.

M. Perrin, A. Mostefaoui, and C. Jard, Causal consistency: beyond memory, Proc. of the 21st ACM Symposium on Principles and Practice of Parallel Programming, pp.1-12, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01286755

. Serge-a-plotkin, Sticky bits and universality of consensus, Proc. of the 8th ACM Symposium on Principles of distributed computing, pp.159-175, 1989.

M. Raynal, Concurrent Programming -Algorithms, Principles, and Foundations, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00922217

M. Raynal, Distributed Universal Constructions: a Guided Tour, Bulletin of the EATCS, vol.121, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01397265

G. Taubenfeld, Distributed Computing Pearls, 2018.

J. Zhang and W. Chen, Bounded cost algorithms for multivalued consensus using binary consensus instances, Inform. Process. Lett, vol.109, pp.1005-1009, 2009.