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.
DOI : 10.1145/153724.153741

Y. Afek, Y. Babichenko, U. Feige, E. Gafni, N. Linial et al., Oblivious Collaboration, Distributed Computing, pp.489-504, 2011.
DOI : 10.1137/S0097539796307698

Y. Afek, U. Babichenko, E. Feige, N. Gafni, B. Linial et al., Musical Chairs, SIAM Journal on Discrete Mathematics, vol.28, issue.3, pp.1578-1600, 2014.
DOI : 10.1137/12088478X

A. Attiya, D. Bar-noy, D. Dolev, R. Peleg, and . Reischuk, Renaming in an asynchronous environment, Journal of the ACM, vol.37, issue.3, pp.524-548, 1990.
DOI : 10.1145/79147.79158

H. Attiya and J. Welch, Distributed Computing Fundamentals, Simulations, and Advanced Topics, Second Edition, 2004.

S. Brenda, E. G. Baker, and . Coffman-jr, Mutual exclusion scheduling, Theor. Comput. Sci, vol.162, issue.2, pp.225-243, 1996.

L. Hans, K. Bodlaender, and . Jansen, Restrictions of graph partition problems. part I, Theor. Comput. Sci, vol.148, issue.1, pp.93-109, 1995.

E. Borowsky and E. Gafni, -resilient asynchronous computations, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.91-100, 1993.
DOI : 10.1145/167088.167119
URL : https://hal.archives-ouvertes.fr/hal-00896459

E. Borowsky and E. Gafni, Immediate atomic snapshots and fast renaming, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing , PODC '93, pp.41-51, 1993.
DOI : 10.1145/164051.164056

A. Castañeda, S. Rajsbaum, M. Magnús, M. Halldórsson, L. Kaplan et al., The renaming problem in shared memory systems: An introduction, Computer Science Review, vol.5, issue.3, pp.229-251199, 2009.
DOI : 10.1016/j.cosrev.2011.04.001

P. Flocchini, G. Prencipe, and N. Santoro, Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory, 2012.

E. Gafni, A. Mostéfaoui, M. Raynal, and C. Travers, From adaptive renaming to set agreement, Structural Information and Communication Complexity, pp.4101328-1335, 2007.
DOI : 10.1016/j.tcs.2008.05.016
URL : https://hal.archives-ouvertes.fr/hal-00432970

E. Gafni and S. Rajsbaum, Recursion in Distributed Computing, Stabilization, Safety, and Security of Distributed Systems, pp.362-376, 2010.
DOI : 10.1007/978-3-642-16023-3_30

R. Garey and R. L. Graham, Bounds for Multiprocessor Scheduling with Resource Constraints, SIAM Journal on Computing, vol.4, issue.2, pp.187-200, 1975.
DOI : 10.1137/0204015

M. Halldórsson, G. Kortsarz, A. Proskurowski, R. Salman, H. Shachnai et al., Multicoloring trees, Information and Computation, vol.180, issue.2, pp.113-129, 2003.
DOI : 10.1016/S0890-5401(02)00032-9

M. Herlihy, D. Kozlov, and S. Rajsbaum, Distributed Computing Through Combinatorial Topology, 2013.

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

M. Raynal, Concurrent Programming: Algorithms, Principles, and Foundations, 2013.
DOI : 10.1007/978-3-642-32027-9
URL : https://hal.archives-ouvertes.fr/hal-00922217