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

D. Angluin, Local and global properties in networks of processors (Extended Abstract), Proceedings of the twelfth annual ACM symposium on Theory of computing , STOC '80, pp.82-93, 1980.
DOI : 10.1145/800141.804655

J. Aspnes, A modular approach to shared-memory consensus, with applications to the probabilistic-write model, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.179-188, 2012.
DOI : 10.1145/1835698.1835802

J. Aspnes and F. Ellen, Tight Bounds for Adopt-Commit Objects, Theory of Computing Systems, vol.38, issue.4, pp.451-474, 2014.
DOI : 10.1007/s00224-013-9448-1

H. Attiya, Adapting to Point Contention with Long-Lived Safe Agreement, Proceedings of the 13th International Colloquium on Structural Information and Communication Complexity(SIROCCO ), pp.10-23, 2006.
DOI : 10.1007/11780823_2

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 M. Snir, Better computing on the anonymous ring, Journal of Algorithms, vol.12, issue.2, pp.204-238, 1991.
DOI : 10.1016/0196-6774(91)90002-G

H. Attiya, M. Snir, and M. K. Warmuth, Computing on an anonymous ring, Journal of the ACM, vol.35, issue.4, pp.845-875, 1988.
DOI : 10.1145/48014.48247

F. Bonnet and M. Raynal, Consensus in Anonymous Distributed Systems: Is There a Weakest Failure Detector?, 2010 24th IEEE International Conference on Advanced Information Networking and Applications, pp.206-213, 2010.
DOI : 10.1109/AINA.2010.19
URL : https://hal.archives-ouvertes.fr/inria-00426674

F. Bonnet and M. Raynal, Anonymous asynchronous systems: the case of failure detectors, Distributed Computing, vol.7, issue.1, pp.141-158, 2013.
DOI : 10.1007/s00446-012-0169-5
URL : https://hal.archives-ouvertes.fr/inria-00452799

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, E. Gafni, N. A. Lynch, and S. Rajsbaum, The BG distributed simulation algorithm, Distributed Computing, vol.14, issue.3, pp.127-146, 2001.
DOI : 10.1007/PL00008933

V. Tushar-deepak-chandra, S. Hadzilacos, and . 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

T. Deepak, C. , and S. Toueg, Unreliable failure detectors for reliable distributed systems, J. ACM, vol.43, issue.2, pp.225-267, 1996.

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

G. Danezis and C. Diaz, A survey of anonymous communication channels, 2008.

C. Delporte, -. Gallet, and H. Fauconnier, Two consensus algorithms with atomic registers and failure detector omega, Proceedings of the 10th International Conference on Distributed Computing and Networking, ICDCN '09, pp.251-262, 2009.

C. Delporte-gallet, H. Fauconnier, E. Gafni, and P. Kuznetsov, Wait-freedom with advice, Distributed Computing, vol.22, issue.5???6, pp.3-19, 2015.
DOI : 10.1007/s00446-014-0231-6
URL : https://hal.archives-ouvertes.fr/hal-01269956

C. Delporte-gallet, H. Fauconnier, and R. Guerraoui, Tight failure detection bounds on atomic object implementations, J. ACM, vol.57, issue.4, 2010.

F. E. Fich, M. Herlihy, and N. Shavit, On the space complexity of randomized synchronization, Journal of the ACM, vol.45, issue.5, pp.843-862, 1998.
DOI : 10.1145/290179.290183

M. J. Fischer, N. A. Lynch, and M. 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

C. Felix, R. Freiling, P. Guerraoui, and . Kuznetsov, The failure detector abstraction, ACM Comput. Surv, vol.43, issue.2, p.9, 2011.

E. Gafni, Round-by-round fault detectors (extended abstract), Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing , PODC '98, pp.143-152, 1998.
DOI : 10.1145/277697.277724

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. Distributed Computing, pp.149-163, 2011.

R. Guerraoui, V. Hadzilacos, P. Kuznetsov, and S. Toueg, The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit, SIAM Journal on Computing, vol.41, issue.6, pp.1343-1379, 2012.
DOI : 10.1137/070698877

R. Guerraoui and E. Ruppert, Anonymous and fault-tolerant shared-memory computing, Distributed Computing, pp.165-177, 2007.
DOI : 10.1007/s00446-007-0042-0

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

M. Loui and H. Abu-amara, Memory requirements for agreement among unreliable asynchronous processes, Advances in Computing Research, pp.163-183, 1987.

A. Mostéfaoui, S. Rajsbaum, M. Raynal, and C. Travers, The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement, SIAM Journal on Computing, vol.38, issue.4, pp.1574-1601, 2008.
DOI : 10.1137/050645580

M. Yamashita and T. Kameda, Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.69-89, 1996.
DOI : 10.1145/62546.62568

M. Yamashita and T. Kameda, Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.90-96, 1996.
DOI : 10.1145/62546.62568

P. Zielinski, Anti-Omega: the weakest failure detector for set agreement, Distributed Computing, pp.335-348, 2010.