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, E. Gafni, and . Lieber, Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus, Proc. 23rd Int'l Symposium on Distributed Computing (DISC'09), Springer Verlag LNCS #5805, pp.111-126, 2009.
DOI : 10.1007/978-3-642-04355-0_14

Y. Afek, E. Gafni, S. Rajsbaum, M. Raynal, and C. Travers, The k-simultaneous consensus problem, Distributed Computing, vol.29, issue.5, pp.185-195, 2010.
DOI : 10.1007/s00446-009-0090-8
URL : https://hal.archives-ouvertes.fr/inria-00543100

D. Angluin, Local and Global Properties in Networks of Processors, Proc. 12th ACM Symposium on Theory of Computing (STOC'80, pp.82-93, 1980.

H. Attiya, A. Bar-noy, D. Dolev, D. Peleg, and R. 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 A. Fouren, Polynomial and Adaptive Long-lived (2p ? 1)-Renaming, Proc. 14th Int'l Symposium on Distributed Computing (DISC'00), pp.149-163, 2000.
DOI : 10.1007/3-540-40026-5_10

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.
DOI : 10.1006/inco.2001.3119

H. Attiya and S. Rajsbaum, The Combinatorial Structure of Wait-Free Solvable Tasks, SIAM Journal on Computing, vol.31, issue.4, pp.1286-1313, 2002.
DOI : 10.1137/S0097539797330689

H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, p.414, 2004.
DOI : 10.1002/0471478210

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

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, A Study of the Wait-free Solvability of Weak Symmetry Breaking and Renaming, Posgrado en Ciencia e Ingeniería de la Computación, 2010.

A. Castañeda and S. Rajsbaum, New combinatorial topology upper and lower bounds for renaming, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.295-304, 2008.
DOI : 10.1145/1400751.1400791

A. Castañeda, S. Rajsbaum, and M. Raynal, The renaming problem in shared memory systems: An introduction, Computer Science Review, vol.5, issue.3, 1960.
DOI : 10.1016/j.cosrev.2011.04.001

J. Chalopin and Y. Métivier, On the power of synchronization between two adjacent processes, Distributed Computing, vol.10, issue.9, pp.177-196, 2010.
DOI : 10.1007/s00446-010-0115-3
URL : https://hal.archives-ouvertes.fr/hal-00527102

T. Chandra and S. Toueg, Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996.
DOI : 10.1145/226643.226647

S. Chaudhuri, More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems, Information and Computation, vol.105, issue.1, pp.132-158, 1993.
DOI : 10.1006/inco.1993.1043

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

D. Dolev, N. Lynch, S. Pinter, E. Stark, and W. Weihl, Reaching approximate agreement in the presence of faults, Journal of the ACM, vol.33, issue.3, pp.499-516, 1986.
DOI : 10.1145/5925.5931

Y. Dinitz, S. Moran, and S. Rajsbaum, Bit complexity of breaking and achieving symmetry in chains and rings, Journal of the ACM, vol.55, issue.1, 2008.
DOI : 10.1145/1326554.1326557

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

E. Gafni, The 01-Exclusion Families of Tasks, Proc. 12th In'l Conference on Principles of Distributed Systems (OPODIS'08, pp.246-258, 2008.

G. Gafni, A. Mostéfaoui, M. Raynal, and C. Travers, From adaptive renaming to set agreement, Theoretical Computer Science, vol.410, issue.14, pp.14-15, 2009.
DOI : 10.1016/j.tcs.2008.05.016
URL : https://hal.archives-ouvertes.fr/hal-00432970

E. Gafni, S. Rajsbaum, and M. Herlihy, Subconsensus Tasks: Renaming Is Weaker Than Set Agreement, Proc. 20th Int'l Symposium on Distributed Computing (DISC'06), pp.329-338, 2006.
DOI : 10.1007/11864219_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.4954

E. Gafni, S. Rajsbaum, M. Raynal, and C. Travers, The Committee Decision Problem, Proc. Latin American Theoretical Informatics Symposium (LATIN'06, pp.502-514, 2006.
DOI : 10.1007/11682462_47
URL : https://hal.archives-ouvertes.fr/inria-00000290

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

M. Herlihy and S. Rajsbaum, On the decidability of distributed decision tasks, Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing , PODC '96, pp.589-598, 1997.
DOI : 10.1145/248052.248110

M. Herlihy and S. Rajsbaum, A classification of wait-free loop agreement tasks, Theoretical Computer Science, vol.291, issue.1, pp.55-77, 2003.
DOI : 10.1016/S0304-3975(01)00396-6

M. Herlihy and S. Rajsbaum, The topology of shared-memory adversaries, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.105-113, 2010.
DOI : 10.1145/1835698.1835724

M. P. 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

. L. Lamport, The part-time parliament, ACM Transactions on Computer Systems, vol.16, issue.2, pp.133-169, 1998.
DOI : 10.1145/279227.279229

A. Mazurkiewicz, Distributed enumeration, Information Processing Letters, vol.61, issue.5, p.233239, 1997.
DOI : 10.1016/S0020-0190(97)00022-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.9042

S. Moran and Y. Wolfsthal, Extended impossibility results for asynchronous complete networks, Information Processing Letters, vol.26, issue.3, pp.141-151, 1987.
DOI : 10.1016/0020-0190(87)90052-4

M. Raynal, Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, 2010.
DOI : 10.2200/S00236ED1V01Y201004DCT002
URL : https://hal.archives-ouvertes.fr/inria-00543036

E. Styer and G. L. Peterson, Tight bounds for shared memory symmetric mutual exclusion problems, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing , PODC '89, pp.177-192, 1989.
DOI : 10.1145/72981.72993

M. Saks and F. Zaharoglou, -set agreement is impossible, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.1449-1483, 2000.
DOI : 10.1145/167088.167122
URL : https://hal.archives-ouvertes.fr/hal-00192526