Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt et al., Atomic snapshots of shared memory, Journal of the ACM, vol.40, issue.4, pp.873-890, 1993.
DOI : 10.1145/153724.153741

D. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, Of choices, failures and asynchrony: The many faces of set agreement
URL : https://hal.archives-ouvertes.fr/hal-00992777

D. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, How to Solve Consensus in the Smallest Window of Synchrony, DISC, pp.32-46, 2008.
DOI : 10.1007/978-3-540-87779-0_3

H. Attiya and O. Rachman, ) Operations, SIAM Journal on Computing, vol.27, issue.2, pp.319-340, 1998.
DOI : 10.1137/S0097539795279463

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

S. Chaudhuri, M. Herlihy, N. A. Lynch, and M. R. Tuttle, A tight lower bound for k-set agreement, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pp.206-215, 1993.
DOI : 10.1109/SFCS.1993.366866

P. Dutta and R. Guerraoui, The inherent price of indulgence, Distributed Computing, pp.85-98, 2005.

C. Dwork, N. 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

E. Gafni, Round-by-round fault detectors (extended abstract), Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing , PODC '98, pp.143-152, 1998.
DOI : 10.1145/277697.277724

E. Gafni, The extended BG-simulation and the characterization of t-resiliency, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, 2009.
DOI : 10.1145/1536414.1536428

E. Gafni, R. Guerraoui, and B. Pochon, From a static impossibility to an adaptive lower bound, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing , STOC '05, pp.714-722, 2005.
DOI : 10.1145/1060590.1060696

R. Guerraoui, M. Herlihy, and B. Pochon, A topological treatment of early-deciding set-agreement, OPODIS, pp.20-35, 2006.

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

I. Keidar and A. Shraer, Timeliness, failure-detectors, and consensus performance, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.169-178, 2006.
DOI : 10.1145/1146381.1146408
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.401

L. Lamport, R. Shostak, and M. Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982.
DOI : 10.1145/357172.357176

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

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