M. K. Aguilera and S. Toueg, A simple bivalency proof that -resilient consensus requires rounds, Information Processing Letters, vol.71, issue.3-4, pp.155-178, 1999.
DOI : 10.1016/S0020-0190(99)00100-3

H. Attiya and J. Welch, Distributed Computing, Fundamentals, Simulation and Advanced Topics, Wiley Series on Parallel and Distributed Computing, p.414, 2004.

H. Attiya and Z. Avidor, Wait-Free n-Set Consensus when Inputs are Restricted, Proc. 16th Int. Symposium on Distributed Computing (DISC'02), pp.326-338, 2002.

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. Lynch, and M. Tuttle, Tight bounds for k-set agreement, Journal of the ACM, vol.47, issue.5, pp.912-943, 2000.
DOI : 10.1145/355483.355489

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

D. Dolev, R. Reischuk, and R. Strong, Early stopping in Byzantine agreement, Journal of the ACM, vol.37, issue.4, pp.720-741, 1990.
DOI : 10.1145/96559.96565

M. J. Fischer and N. A. Lynch, A lower bound for the time to assure interactive consistency, Information Processing Letters, vol.14, issue.4, pp.183-186, 1982.
DOI : 10.1016/0020-0190(82)90033-3

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

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

V. K. Garg, Elements of Distributed Computing, 2002.

R. Guerraoui, P. Kouznetsov, and B. Pochon, A note on Set Agreement with Omission Failures, Electronic Notes in Theoretical Computer Science, vol.81, 2003.

V. Hadzilacos and S. Toueg, Reliable Broadcast and Related Problems, Distributed Systems, pp.97-145, 1993.

M. P. Herlihy and L. D. Penso, Tight Bounds for k-Set Agreement with Limited Scope Accuracy Failure Detectors, Distributed Computing, pp.157-166, 2005.
DOI : 10.1007/978-3-540-39989-6_20

M. P. 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 S. Rajsbaum, A simple proof of the uniform consensus synchronous lower bound, Information Processing Letters, vol.85, issue.1, pp.47-52, 2003.
DOI : 10.1016/S0020-0190(02)00333-2

N. A. Lynch, Distributed Algorithms, 1996.

A. Mostéfaoui, S. Rajsbaum, and M. , The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement, Proc. 24th ACM Symposium on Principles of Distributed Computing (PODC'05), pp.179-188, 2005.
DOI : 10.1137/050645580

A. Mostéfaoui and M. Raynal, k-set agreement with limited accuracy failure detectors, Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing , PODC '00, pp.143-152, 2000.
DOI : 10.1145/343477.343536

G. Neiger and S. Toueg, Automatically increasing the fault-tolerance of distributed algorithms, Journal of Algorithms, vol.11, issue.3, pp.374-419, 1990.
DOI : 10.1016/0196-6774(90)90019-B

K. J. Perry and S. Toueg, Distributed agreement in the presence of processor and communication faults, IEEE Transactions on Software Engineering, vol.12, issue.3, pp.12477-482, 1986.
DOI : 10.1109/TSE.1986.6312888

R. Parvédy-ph and M. Raynal, Optimal early stopping uniform consensus in synchronous systems with process omission failures, Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures , SPAA '04, pp.302-310, 2004.
DOI : 10.1145/1007912.1007963

R. Parvédy-ph, M. Raynal, and C. Travers, Early-Stopping k-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes, 8th Int. Conference on Parallel Computing Technologies (PaCT'05), Krasnoyarsk (Russia), pp.49-58, 2005.
DOI : 10.1007/11535294_5

R. Parvédy-ph, M. Raynal, and C. Travers, Decision Optimal Early-Stopping k-set Agreement in Synchronous Systems Prone to Send Omission Failures, 11th Pacific Rim International Symposium on Dependable Computing (PRDC'05), pp.23-30, 2005.
DOI : 10.1109/PRDC.2005.28

R. Parvédy-ph, M. Raynal, and C. Travers, Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures, Proc. 13th Colloquium on Structural Information and Communication Complexity Spirnger-Verlag LNCS Liverpool (UK), 2006.
DOI : 10.1007/11780823_15

M. Raynal, Consensus in synchronous systems: a concise guided tour, 2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings., pp.221-228, 2002.
DOI : 10.1109/PRDC.2002.1185641

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