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

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

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

R. Guerraoui, M. Kapa?ka, and P. Kouznetsov, The Weakest Failure Detectors to Boost Obstruction-Freedom, Proc. 20th Symposium on Distributed Computing (DISC'06), pp.376-390, 2006.

R. Guerraoui and M. Raynal, The information structure of indulgent consensus, IEEE Transactions on Computers, vol.53, issue.4, pp.453-466, 2004.
DOI : 10.1109/TC.2004.1268403

R. Guerraoui and M. Raynal, The Alpha of Indulgent Consensus, The Computer Journal, vol.50, issue.1, 2006.
DOI : 10.1093/comjnl/bxl046

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 L. D. Penso, Tight Bounds for k-Set Agreement with Limited Scope Accuracy Failure Detectors, Distributed Computing, pp.157-166, 2005.

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

M. C. 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, Irreducibility and additivity of set agreement-oriented failure detector classes, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, 2006.
DOI : 10.1145/1146381.1146406

A. Mostéfaoui and M. Raynal, 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, 2000.
DOI : 10.1145/343477.343536

A. Mostéfaoui and M. Raynal, LEADER-BASED CONSENSUS, Parallel Processing Letters, vol.11, issue.01, pp.95-107, 2001.
DOI : 10.1142/S0129626401000452

A. Mostéfaoui, M. Raynal, and C. Travers, Exploring Gafni's reduction land: from k to wait-free adaptive (2p

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

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-308, 1998.
DOI : 10.1145/277697.277755