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 and I. Nir, Failure detectors in loosely named systems, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.67-74, 2008.
DOI : 10.1145/1400751.1400762

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.

H. Attiya and A. Fouren, Adaptive and Efficient Algorithms for Lattice Agreement and Renaming, SIAM Journal on Computing, vol.31, issue.2, pp.642-664, 2001.
DOI : 10.1137/S0097539700366000

H. Attiya and O. Rachman, ) Operations, SIAM Journal on Computing, vol.27, issue.2, pp.319-340, 1998.
DOI : 10.1137/S0097539795279463

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

O. Biran, S. Moran, and S. Zaks, A combinatorial characterization of the distributed 1-solvable tasks, Journal of Algorithms, vol.11, issue.3, pp.420-440, 1990.
DOI : 10.1016/0196-6774(90)90020-F

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 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

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

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

A. Fouren, Exponential Examples of Two Renaming Algorithms, 1999.

E. Gafni, Renaming with k-Set-Consensus: An Optimal Algorithm into n + k ??? 1 Slots, Proc. 10th Int'l Conference On Principles Of Distributed Systems (OPODIS'06), Springer Verlag LNCS #4305, pp.36-44, 2006.
DOI : 10.1007/11945529_4

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 and S. Rajsbaum, Recursion in Distributed Computing, Proc. 12th Int'l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'10), pp.362-376, 2010.
DOI : 10.1007/978-3-642-16023-3_30

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

G. Gafni, M. Raynal, C. Travers, and . Test&set, From adaptive renaming to set agreement, 26th IEEE Symposium on Reliable Distributed Systems (SRDS'07), pp.93-102, 2007.
DOI : 10.1016/j.tcs.2008.05.016
URL : https://hal.archives-ouvertes.fr/hal-00432970

M. 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. P. Herlihy, V. Luchangco, and M. Moir, Obstruction-free synchronization: double-ended queues as an example, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., pp.522-529, 2003.
DOI : 10.1109/ICDCS.2003.1203503

M. Herlihy and S. Rajsbaum, New Perspectives in Distributed Computing, Proc. 24th Int'l Symposium on Mathematical Foundations of Computer Science (MFCS'99), pp.170-186, 2006.
DOI : 10.1007/3-540-48340-3_16

M. Herlihy and S. Rajsbaum, Algebraic spans, Mathematical Structures in Computer Science, vol.10, issue.4, pp.549-573, 2000.
DOI : 10.1017/S0960129500003170

M. Herlihy, S. Rajsbaum, and M. Tuttle, An Overview of Synchronous Message-Passing and Topology, Electronic Notes in Theoretical Computer Science, vol.39, issue.2, pp.1-17, 2001.
DOI : 10.1016/S1571-0661(05)01148-5

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

M. P. Herlihy and N. Shavit, The art of multiprocessor programming, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, p.508, 2008.
DOI : 10.1145/1146381.1146382

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

D. Imbs and M. Raynal, Help when Needed, but no More: Ecient Read/Write Partial Snapshot, Proc. 23th Int'l Symposium on Distributed Computing (DISC'09 Springer-Verlag LNCS #5805, pp.142-156, 2009.

D. Imbs and M. Raynal, On Adaptive Renaming under Eventually Limited Contention, 12th Int'l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'10), pp.377-387, 2010.
DOI : 10.1007/978-3-642-16023-3_31
URL : https://hal.archives-ouvertes.fr/inria-00543135

. L. Lamport, On interprocess communication, Distributed Computing, vol.21, issue.2, pp.77-101, 1986.
DOI : 10.1007/BF01786227

L. Lamport, A fast mutual exclusion algorithm, ACM Transactions on Computer Systems, vol.5, issue.1, pp.1-11, 1987.
DOI : 10.1145/7351.7352

M. Loui and H. Abu-amara, Memory Requirements for for agreement among Unreliable Asynchronous processes, Advances in Computing Research, pp.163-183, 1987.

N. A. Lynch, Distributed Algorithms, 1996.

M. Moir, Fast, long-lived renaming improved and simplified, Science of Computer Programming, vol.30, issue.3, pp.287-308, 1998.
DOI : 10.1016/S0167-6423(97)00016-6

M. Moir and J. Anderson, Wait-free algorithms for fast, long-lived renaming, Science of Computer Programming, vol.25, issue.1, pp.1-39, 1995.
DOI : 10.1016/0167-6423(95)00009-H

M. Mostéfaoui, M. Raynal, and T. C. , Exploring Gafni???s Reduction Land: From ?? k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement, Proc. 20th Int'l Symposium on Distributed Computing (DISC'09), pp.1-15, 2006.
DOI : 10.1007/11864219_1

A. Mostéfaoui, M. Raynal, and C. Travers, From Renaming to Set Agreement, 14th Int'l Colloquium on Structural Information and Communication Complexity (SIROCCO'07), pp.62-76, 2007.
DOI : 10.1007/978-3-540-72951-8_7

G. Neiger and S. Linearizability, Brief Announcement, Proc. 13th ACM Symposium on Principles of Distributed Computing (PODC'94, p.396, 1994.

G. Neiger, Failure Detectors and the Wait-free Hierarchy, 14th ACM Symposium on Principles of Distributed Computing (PODC'95), pp.100-109, 1995.

S. Rajsbaum, Iterated Shared Memory Models, Proc. 9th Latin American Symposium Theoretical Informatics (LATIN'10), pp.407-416, 2010.
DOI : 10.1007/978-3-642-12200-2_36

S. Rajsbaum and M. Raynal, A Theory-Oriented Introduction to Wait-Free Synchronization Based on the Adaptive Renaming Problem, 2011 IEEE International Conference on Advanced Information Networking and Applications, 2011.
DOI : 10.1109/AINA.2011.9
URL : https://hal.archives-ouvertes.fr/hal-00649266

M. Raynal, Locks Considered Harmful: A Look at Non-traditional Synchronization, Proc. 6th Int'l Workshop on Software Technologies for Future Embedded and Ubiquitous Computing Systems (SEUS'08), pp.369-380, 2008.
DOI : 10.1007/11945529_2

M. Raynal, A short introduction to failure detectors for asynchronous distributed systems, ACM SIGACT News, vol.36, issue.1, pp.1181-1191, 2009.
DOI : 10.1145/1052796.1052806

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

M. Raynal, Fault-tolerant Agreement in Synchronous Message-passing Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, p.2010
DOI : 10.2200/S00294ED1V01Y201009DCT003
URL : https://hal.archives-ouvertes.fr/inria-00543049

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

G. Taubenfeld, On the Computational Power of Shared Objects, Proc. 13th Int'l Conference On Principle Of Distributed Systems, pp.270-284, 2009.
DOI : 10.1007/978-3-642-10877-8_22