M. K. Aguilera, C. Delporte-gallet, H. Fauconnier, and S. Toueg, Communication-efficient leader election and consensus with limited link synchrony, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.328-337, 2004.
DOI : 10.1145/1011767.1011816
URL : https://hal.archives-ouvertes.fr/hal-00154865

M. K. Aguilera, C. Delporte-gallet, H. Fauconnier, and S. Toueg, On implementing omega in systems with weak reliability and synchrony assumptions, Distributed Computing, pp.285-314, 2008.
DOI : 10.1007/s00446-008-0068-y

M. K. Aguilera and S. Toueg, Timeliness-based wait-freedom, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.305-314, 2008.
DOI : 10.1145/1400751.1400792

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 and E. Gafni, A simple algorithmically reasoned characterization of wait-free computation (extended abstract), Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing , PODC '97, pp.189-198, 1997.
DOI : 10.1145/259380.259439

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
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
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
URL : http://doi.org/10.1006/inco.1993.1043

C. Dwork, N. A. Lynch, and L. Stockmeyer, Consensus in the presence of partial synchrony, Journal of the ACM, vol.35, issue.2, pp.288-323, 1988.
DOI : 10.1145/42282.42283

A. Fernández and M. , From an intermittent rotating star to a leader, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, 2006.
DOI : 10.1145/1281100.1281152

M. Herlihy and N. Shavit, The asynchronous computability theorem for t-resilient tasks (preliminary version), ACM Symposium on Theory of Computing, pp.111-120, 1993.

M. Hutle, D. Malkhi, U. Schmid, and L. Zhou, Chasing the weakest system model for implementing ? and Consensus, IEEE Transactions on Dependable and Secure Computing
DOI : 10.1109/tdsc.2008.24

E. Jiménez, S. Arévalo, and A. Fernández, Implementing unreliable failure detectors with unknown membership, Information Processing Letters, vol.100, issue.2, pp.60-63, 2006.
DOI : 10.1016/j.ipl.2006.05.009

D. Malkhi, F. Oprea, and L. Zhou, Omega meets Paxos: leader election and stability without eventual timely links, International Conference on Distributed Computing, pp.199-213, 2005.
DOI : 10.1007/11561927_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.8257

A. Mostefaoui, M. Raynal, and C. Travers, Time-free and timer-based assumptions can be combined to obtain eventual leadership, IEEE Transactions on Parallel and Distributed Systems, vol.17, issue.7, pp.656-666, 2006.
DOI : 10.1109/TPDS.2006.95
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.659.6005

S. Rajsbaum, M. Raynal, and C. Travers, Failure detectors as schedulers (an algorithmically-reasoned characterization), 2007.
URL : https://hal.archives-ouvertes.fr/inria-00139317

S. Rajsbaum, M. Raynal, and C. Travers, The Iterated Restricted Immediate Snapshot Model, International Computing and Combinatorics Conference, pp.487-497, 2008.
DOI : 10.1007/978-3-540-69733-6_48
URL : https://hal.archives-ouvertes.fr/hal-00829436

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, ACM Symposium on Principles of Distributed Computing, pp.55-64, 2008.