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

S. and ?. ?. Dom, B k ; 10 for j = 3, . . . , l do 11 add smallest a ? A(S) to faulty i s.t. a domin, b 2 in A(S) A(S), B k and ?a ? ? faulty i

E. Borowsky and E. Gafni, Immediate atomic snapshots and fast renaming, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing , PODC '93, pp.41-51, 1993.
DOI : 10.1145/164051.164056

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, P. Hadzilacos, S. Jayanti, and . Toueg, -Resilient and Wait-Free Implementations of Consensus, SIAM Journal on Computing, vol.34, issue.2, pp.333-357, 2004.
DOI : 10.1137/S0097539798344367

V. Tushar-deepak-chandra, S. Hadzilacos, and . Toueg, The weakest failure detector for solving consensus, Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing (PODC'92), pp.147-158, 1992.

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, Agreement is harder than consensus: set consensus problems in totally asynchronous systems, Proceedings of the ninth annual ACM symposium on Principles of distributed computing , PODC '90, 1990.
DOI : 10.1145/93385.93431

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

M. Fitzi and U. M. Maurer, Efficient Byzantine agreement secure against general adversaries, Lecture Notes in Computer Science, vol.1499, pp.134-148, 1998.
DOI : 10.1007/BFb0056479

R. Guerraoui, M. Herlihy, P. Kouznetsov, N. A. Lynch, and C. C. Newport, On the weakest failure detector ever, PODC, 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. Herlihy and J. M. Wing, Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.463-492, 1990.
DOI : 10.1145/78969.78972

P. Jayanti, Robust wait-free hierarchies, Journal of the ACM, vol.44, issue.4, pp.592-614, 1997.
DOI : 10.1145/263867.263888

F. Paiva, J. , and K. Marzullo, Designing algorithms for dependent process failures, Future Directions in Distributed Computing, pp.24-28, 2003.

W. Lo and V. Hadzilacos, Using failure detectors to solve consensus in asynchronous shared-memory systems, Lecture Notes in Computer Science, vol.857, pp.280-295, 1994.
DOI : 10.1007/BFb0020440

E. Michael, F. Saks, and . Zaharoglou, Wait-free k-set agreement is impossible: The topology of public knowledge, SIAM J. Comput, vol.29, issue.5, pp.1449-1483, 2000.

P. Zielinski, Anti-Omega: the weakest failure detector for set agreement, PODC, pp.55-64, 2008.