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, S. Rajsbaum, M. Raynal, and C. Travers, The k-simultaneous consensus problem, Distributed Computing, vol.29, issue.5, 2010.
DOI : 10.1007/s00446-009-0090-8
URL : https://hal.archives-ouvertes.fr/inria-00543100

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 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, Simulation and Advanced Topics, Wiley Series on Parallel and Distributed Computing, p.414, 2004.

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, The Implication of the Borowsky-Gafni Simulation on the Set Consensus Hierarchy, 1993.

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

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, V. Hadzilacos, P. Jayanti, and T. S. , -Resilient and Wait-Free Implementations of Consensus, SIAM Journal on Computing, vol.34, issue.2, pp.333-357, 2004.
DOI : 10.1137/S0097539798344367
URL : https://hal.archives-ouvertes.fr/hal-00186366

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

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

S. Chaudhuri and P. Reiners, Understanding the Set Consensus Partial Order using the Borowsky-Gafni Simulation, Proc. 10th Int'l Workshop on Distributed Algorithms (WDAG'96, pp.362-379, 1996.
DOI : 10.1007/3-540-61769-8_23

C. Delporte-gallet, H. Fauconnier, R. Guerraoui, V. Hadzilacos, P. Kouznetsov et al., The weakest failure detectors to solve certain fundamental problems in distributed computing, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.338-346, 2004.
DOI : 10.1145/1011767.1011818

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, Round-by-round Fault Detectors: Unifying Synchrony and Asynchrony, Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC'98), pp.143-152, 1998.

E. Gafni, The extended BG-simulation and the characterization of t-resiliency, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.85-92, 2009.
DOI : 10.1145/1536414.1536428

E. Gafni and P. Kuznetsov, On Set Consensus Numbers, Proc. 23th Int'l Symposium on on Distributed Computing (DISC'09), Springer Verlag LNCS #5805, pp.35-47, 2009.

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

R. Guerraoui and P. Kuznetsov, Failure detectors as type boosters, Distributed Computing, vol.30, issue.4, pp.343-358, 2008.
DOI : 10.1007/s00446-007-0043-z

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 S. Rajsbaum, Algebraic spans, Mathematical Structures in Computer Science, vol.10, issue.4, pp.549-573, 2000.
DOI : 10.1017/S0960129500003170

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

D. Imbs and M. Raynal, Visiting Gafni???s Reduction Land: From the BG Simulation to the Extended BG Simulation, Proc. 11th Int'l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'09), pp.369-383, 2009.
DOI : 10.1007/978-3-642-05118-0_26

D. Imbs and M. Raynal, The multiplicative power of consensus numbers, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, 2010.
DOI : 10.1145/1835698.1835705
URL : https://hal.archives-ouvertes.fr/inria-00543130

M. C. Loui and H. H. Abu-amara, Memory Requirements for Agreement Among Unreliable Asynchronous Processes, of Advances in Comp. Research, pp.163-183, 1987.

N. A. Lynch, Distributed Algorithms, 1996.

A. Mostéfaoui, M. Raynal, and C. Travers, Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound, Theoretical Computer Science, vol.411, issue.1, pp.58-69, 2010.
DOI : 10.1016/j.tcs.2009.09.002

G. Neiger, Failure Detectors and the Wait-free Hierarchy, Proc. 14th 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