D. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, Of choices, failures and asynchrony: The many faces of set agreement, ISAAC 2009, LNCS # 5878, pp.943-953
URL : https://hal.archives-ouvertes.fr/hal-00992777

A. F. Anta, S. Rajsbaum, and C. Travers, Brief announcement: weakest failure detectors via an egg-laying simulation, pp.290-291, 2009.

A. F. Anta, S. Rajsbaum, and C. Travers, Weakest failure detectors via an egg-laying simulation (preliminary version), Reports on Systems and Communications, issue.2, 2009.

F. Bonnet and M. , Looking for the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems: Is ${\it \Pi}_k$ the End of the Road?, SSS 2009, LNCS # 5873, pp.149-164
DOI : 10.1007/978-3-642-05118-0_11

F. Bonnet and M. , A simple proof of the necessity of the failure detector ?? to implement an atomic register in asynchronous message-passing systems, Information Processing Letters, vol.110, issue.4, pp.153-157, 2010.
DOI : 10.1016/j.ipl.2009.11.011
URL : https://hal.archives-ouvertes.fr/inria-00543125

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
DOI : 10.1145/167088.167119
URL : https://hal.archives-ouvertes.fr/hal-00896459

T. D. 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

T. D. 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.498

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 2007, LNCS # 4731, pp.123-138
DOI : 10.1007/978-3-540-75142-7_12

C. Delporte-gallet, H. Fauconnier, and R. Guerraoui, Sharing is harder than agreeing, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.85-94, 2008.
DOI : 10.1145/1400751.1400764
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.5273

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

C. Delporte-gallet, H. Fauconnier, R. Guerraoui, and A. Tielmann, The Weakest Failure Detector for Message Passing Set-Agreement, DISC 2008, LNCS # 5218, pp.109-120
DOI : 10.1007/978-3-540-87779-0_8
URL : https://hal.archives-ouvertes.fr/hal-00260000

H. Delporte-gallet, R. Fauconnier, A. Guerraoui, and . Tielmann, The disagreement power of an adversary, Proceedings of the 28th ACM symposium on Principles of distributed computing, PODC '09, pp.288-289, 2009.
DOI : 10.1145/1582716.1582769
URL : https://hal.archives-ouvertes.fr/hal-00376981

P. Dutta and R. Guerraoui, The inherent price of indulgence, Distributed Computing, pp.85-98, 2005.

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

E. Gafni and P. Kuznetsov, The weakest failure detector for solving k-set agreement, Proceedings of the 28th ACM symposium on Principles of distributed computing, PODC '09, pp.83-91
DOI : 10.1145/1582716.1582735

R. Guerraoui, Indulgent algorithms (preliminary version), Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing , PODC '00, pp.289-297, 2000.
DOI : 10.1145/343477.343630
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.583.6812

R. Guerraoui, M. Herlihy, P. Kuznetsov, N. A. Lynch, and C. C. Newport, On the weakest failure detector ever, Distributed Computing, pp.353-366, 2009.

R. Guerraoui and N. A. Lynch, A general characterization of indulgence, Transactions on Autonomous and Adaptive Systems, vol.3, issue.4, 2008.

R. Guerraoui and M. , The Alpha of Indulgent Consensus, The Computer Journal, vol.50, issue.1, pp.53-67, 2007.
DOI : 10.1093/comjnl/bxl046

V. Hadzilacos and S. Toueg, Reliable broadcast and related problems, pp.97-145, 1993.

M. Herlihy and L. D. Penso, Tight bounds for k-set agreement with limited-scope failure detectors, Distributed Computing, vol.29, issue.(5), pp.157-166, 2005.
DOI : 10.1007/s00446-005-0141-8

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

A. Mostéfaoui, S. Rajsbaum, M. Raynal, and C. Travers, On the computability power and the robustness of set agreement-oriented failure detector classes, Distributed Computing, pp.201-222, 2008.
DOI : 10.1007/s00446-008-0064-2

A. Mostéfaoui and M. , k-set agreement with limited accuracy failure detectors, Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing , PODC '00, pp.143-152
DOI : 10.1145/343477.343536

G. Neiger, Failure detectors and the wait-free hierarchy, PODC 1995, pp.100-109

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

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

J. Yang, G. Neiger, and E. Gafni, Structured derivations of consensus algorithms for failure detectors, Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing , PODC '98, pp.297-306, 1998.
DOI : 10.1145/277697.277755

P. Zieli´nskizieli´nski, Anti-omega: the weakest failure detector for set agreement, PODC 2008, pp.55-64