B. V. Ashwinkumar, A. Patra, A. Choudhary, K. Srinathan, and C. P. Rangan, On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary, PODC, pp.115-124, 2008.

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

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

T. D. Chandra, V. Hadzilacos, P. Jayanti, and S. Toueg, -Resilient and Wait-Free Implementations of Consensus, SIAM Journal on Computing, vol.34, issue.2, pp.333-357, 2004.
DOI : 10.1137/S0097539798344367

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

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

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, pp.311-324, 1990.
DOI : 10.1145/93385.93431

C. Delporte-gallet, H. Fauconnier, R. Guerraoui, and A. Tielmann, The Disagreement Power of an Adversary, Lecture Notes in Computer Science, vol.5805, pp.8-21, 2009.
DOI : 10.1007/978-3-642-04355-0_6

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

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, DISC, pp.134-148, 1998.
DOI : 10.1007/BFb0056479

M. Herlihy and S. Rajsbaum, The decidability of distributed decision tasks (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.589-598, 1997.
DOI : 10.1145/258533.258652

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

F. P. Junqueira and K. Marzullo, Designing Algorithms for Dependent Process Failures, Future Directions in Distributed Computing, pp.24-28, 2003.
DOI : 10.1109/24.740491

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

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