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

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, Journal of the 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

W. Chen, J. Zhang, Y. Chen, and X. Liu, Weakening Failure Detectors for k-Set Agreement Via the Partition Approach, DISC, pp.123-138, 2007.
DOI : 10.1007/978-3-540-75142-7_12

C. Delporte-gallet, H. Fauconnier, and R. Guerraoui, Shared memory vs message passing, 2003.

C. Delporte-gallet, H. Fauconnier, and R. Guerraoui, Sharing information is harder than agreeing, 2008.

R. Guerraoui, Non-blocking atomic commit in asynchronous distributed systems with failure detectors, Distributed Computing, pp.17-25, 2002.
DOI : 10.1007/s446-002-8027-4

R. Guerraoui, M. Herlihy, P. Kouznetsov, N. Lynch, and C. Newport, On the weakest failure detector ever, PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, pp.235-243, 2007.

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

M. Raynal and C. Travers, In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement, OPODIS, pp.3-19, 2006.
DOI : 10.1007/11945529_2
URL : https://hal.archives-ouvertes.fr/inria-00089977

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

P. Zieli´nskizieli´nski, Anti-?: the weakest failure detector for set-agreement, 2007.