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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.6341

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

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

URL : http://doi.org/10.1006/inco.1993.1043

F. Chu, Reducing to 3W, Information Processing Letters, vol.76, issue.6, pp.293-298, 1998.

P. Dutta and R. Guerraoui, Fast Indulgent Consensus with Zero Degradation, Proc. 4th European Dependable Computing Conference Springer-Verlag LNCS #2485, pp.191-208, 2002.
DOI : 10.1007/3-540-36080-8_18

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.3492

C. Delporte-gallet, H. Fauconnier, and R. Guerraoui, (Almost) All Objects Are Universal in Message Passing Systems, Proc. 19th Symposium on Distributed Computing (DISC'05), pp.184-198, 2005.
DOI : 10.1007/11561927_15

URL : https://hal.archives-ouvertes.fr/hal-00154869

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

V. Hadzilacos and S. Toueg, Reliable Broadcast and Related Problems, Distributed Systems, pp.97-145, 1993.

M. P. Herlihy and L. D. Penso, Tight Bounds for k-Set Agreement with Limited Scope Accuracy Failure Detectors, Proc. 17th Symposium on Distributed Computing (DISC'03), pp.279-291, 2003.
DOI : 10.1007/978-3-540-39989-6_20

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

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

L. Lamport, The part-time parliament, ACM Transactions on Computer Systems, vol.16, issue.2, pp.133-169, 1998.
DOI : 10.1145/279227.279229

A. Mostefaoui, S. Rajsbaum, and M. Raynal, Conditions on input vectors for consensus solvability in asynchronous distributed systems, Journal of the ACM, vol.50, issue.6, pp.922-954, 2003.
DOI : 10.1145/950620.950624

A. Mostefaoui, S. Rajsbaum, and M. Raynal, The combined power of conditions and failure detectors to solve asynchronous set agreement, Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing , PODC '05, pp.179-188, 2005.
DOI : 10.1145/1073814.1073848

A. Mostefaoui, S. Rajsbaum, M. Raynal, and C. Travers, From 3W to : a Simple Bounded Quiescent Reliable broadcast-based Transformation, IRISA, University of Rennes, vol.1, 2005.

A. Most and M. Raynal, Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: a General Quorum-Based Approach, Proc. 13th Symposium on Distributed Computing (DISC'99), pp.49-63, 1999.

A. Mostefaoui 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 and M. Raynal, Leader-Based Consensus, Parallel Processing Letters, vol.11, issue.1, pp.95-107, 2001.

G. Neiger, Failure Detectors and the Wait-free Hierarchy, Proc. 14th ACM Symposium on Principles of Distributed Computing (PODC'95), A CM Press, pp.100-109, 1995.

M. Raynal and . Short, A short introduction to failure detectors for asynchronous distributed systems, ACM SIGACT News, vol.36, issue.1, pp.53-70, 2005.
DOI : 10.1145/1052796.1052806

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

A. Schiper, Early Consensus in an Asynchronous System with a Weak Failure Detector, Distributed Computing, pp.149-157, 1997.

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