Y. Afek, E. Gafni, S. Rajsbaum, M. Raynal, and C. Travers, The k-simultaneous consensus problem, Distributed Computing, pp.185-195, 2010.
DOI : 10.1007/s00446-009-0090-8

URL : https://hal.archives-ouvertes.fr/inria-00543100

M. K. Aguilera, C. Delporte-gallet, H. Fauconnier, and S. Toueg, Partial synchrony based on set timeliness, Distributed Computing, pp.249-260, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00408738

D. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement, Algorithmica, vol.20, issue.2, pp.595-629, 2012.
DOI : 10.1007/s00453-011-9581-7

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

H. Attiya, A. Bar-noy, and D. Dolev, Sharing memory robustly in message-passing systems, Journal of the ACM, vol.42, issue.1, pp.124-142, 1995.
DOI : 10.1145/200836.200869

J. Bárány, A short proof of Kneser's conjecture, Journal of Combinatorial Theory, Series A, vol.25, issue.3, pp.325-326, 1978.
DOI : 10.1016/0097-3165(78)90023-7

F. Bonnet and M. , On the road to the weakest failure detector for <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>k</mml:mi></mml:math>-set agreement in message-passing systems, Theoretical Computer Science, vol.412, issue.33, pp.4273-4284, 2011.
DOI : 10.1016/j.tcs.2010.11.007

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

Z. Bouzid and C. Travers, $(\mathrm{anti-}\Omega^{x} \times \Sigma_{z})$ -Based k-Set Agreement Algorithms, Proceedings 14th International Conference on Principles of Distributed Systems (OPODIS), pp.189-204, 2010.
DOI : 10.1137/S0097539796307698

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

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

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. Delporte-gallet, H. Fauconnier, and R. Guerraoui, Tight failure detection bounds on atomic object implementations, J. ACM, vol.57, issue.4, 2010.

C. Delporte-gallet, H. Fauconnier, R. Guerraoui, and A. Tielmann, The weakest failure detector for message passing setagreement, Proceedings 22nd International Symposium on Distributed Computing (DISC), ser, 2008.
DOI : 10.1007/978-3-540-87779-0_8

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

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

E. Gafni and R. Guerraoui, Generalized Universality, Proceedings 22nd International Conference on Concurrency Theory (CONCUR), ser, pp.17-27, 2011.
DOI : 10.1145/359545.359563

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

E. Gafni and P. Kuznetsov, The weakest failure detector for solving k-set agreement, Proceedings of the 28th ACM symposium on Principles of distributed computing, PODC '09, pp.83-91, 2009.
DOI : 10.1145/1582716.1582735

E. Gafni, S. Rajsbaum, M. Raynal, and C. Travers, The Committee Decision Problem, Proceedings 7th Latin American Symposium on Theoretical Informatics (LATIN), pp.502-514, 2006.
DOI : 10.1007/11682462_47

URL : https://hal.archives-ouvertes.fr/inria-00000290

J. Greene, A New Short Proof of Kneser's Conjecture, The American Mathematical Monthly, vol.109, issue.10, pp.918-920, 2002.
DOI : 10.2307/3072460

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

L. Lovász, Kneser's conjecture, chromatic number, and homotopy, Journal of Combinatorial Theory, Series A, vol.25, issue.3, pp.319-324, 1978.
DOI : 10.1016/0097-3165(78)90022-5

J. Matou?ek, A Combinatorial Proof of Kneser???s Conjecture*, COMBINATORICA, vol.24, issue.1, pp.163-170, 2004.
DOI : 10.1007/s00493-004-0011-1

A. Mostéfaoui, S. Rajsbaum, M. Raynal, and C. Travers, On the computability power and the robustness of set agreementoriented failure detector classes, Distributed Computing, pp.201-222, 2008.

A. Mostéfaoui, M. Raynal, and J. Stainer, Relations linking failure detectors associated with k-set agreement in messagepassing systems, 13th Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), ser. Lecture Notes in Computer Science, pp.341-355, 2011.

P. R. Parvédy, M. Raynal, and C. Travers, Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures, Theory Comput. Syst, vol.47, issue.1, pp.259-287, 2010.
DOI : 10.1007/11780823_15

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, Distributed Computing, pp.335-348, 2010.