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, M. Merritt, and . Fast, Wait-Free (2k ; 1)-Renaming, Proc. 18th ACM Symposium on Principles of Distributed Computing (PODC'99), A CM Press, pp.105-112, 1999.

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, F. , and A. , Polynomial and Adaptive Long-lived (2k- 1)-Renaming, Proc. Symposium on Distributed Computing, pp.149-163, 2000.
DOI : 10.1007/3-540-40026-5_10

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 J. Welch, Distributed Computing: Fundamentals, Simulations and Advanced T opics, p.414, 2004.
DOI : 10.1002/0471478210

P. A. Bernstein and N. Goodman, Concurrency Control in Distributed Database Systems, ACM Computing Surveys, vol.13, issue.2, pp.185-221, 1981.
DOI : 10.1145/356842.356846

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

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

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

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

E. Gafni, /. Read, and . Reductions, DISC/GODEL presentation given as introduction to the 18th Int'l Symposium on Distributed Computing, 2004.

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

R. Guerraoui and M. Raynal, The Alpha and Omega of Asynchronous Consensus, 1676.

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. 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-1699, 1998.
DOI : 10.1145/279227.279229

M. Moir and J. H. 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
URL : http://doi.org/10.1016/0167-6423(95)00009-h

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

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