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

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 Z. Avidor, Wait-Free n-Set Consensus when Inputs are Restricted, Proc. 16th Int. Symposium on Distributed Computing (DISC'02), pp.326-338, 2002.

H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, p.451, 1998.
DOI : 10.1002/0471478210

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

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

R. Friedman, A. Mostéfaoui, S. Rajsbaum, S. Raynal, and M. , Asynchronous Agreement and Its Relation with Error-Correcting Codes, IEEE Transactions on Computers, vol.56, issue.7, pp.865-876, 2007.
DOI : 10.1109/TC.2007.1043
URL : https://hal.archives-ouvertes.fr/inria-00338071

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, 2005.
DOI : 10.1145/1060590.1060696

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

T. Izumi and T. Masuzawa, Condition adaptation in synchronous consensus, IEEE Transactions on Computers, vol.55, issue.7, pp.843-853, 2006.
DOI : 10.1109/TC.2006.99

T. Izumi and T. Masuzawa, A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems, Information Processing Letters, vol.100, issue.5, pp.199-205, 2006.
DOI : 10.1016/j.ipl.2006.07.003

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

M. C. Loui and H. H. Abu-amara, Memory Requirements for Agreement Among Unreliable Asynchronous Processes, Parallel and Distributed Computing of Advances in Computing Research, pp.163-183, 1987.

N. A. Lynch, Distributed Algorithms, 1996.

Y. Moses and S. Rajsbaum, A Layered Analysis of Consensus, SIAM Journal on Computing, vol.31, issue.4, pp.989-1021, 2002.
DOI : 10.1137/S0097539799364006

A. Mostefaoui, S. Rajsbaum, and M. Raynal, Conditions on input vectors for consensus solvability in asynchronous distributed systems, Journal of the ACM, vol.50, issue.6, pp.922-954, 2003.
DOI : 10.1145/950620.950624

A. Mostefaoui, S. Rajsbaum, and M. Raynal, The combined power of conditions and failure detectors to solve asynchronous set agreement, Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing , PODC '05, pp.179-188, 2005.
DOI : 10.1145/1073814.1073848

A. Mostefaoui, S. Rajsbaum, and M. Raynal, Synchronous condition-based consensus, Distributed Computing, vol.11, issue.1, pp.325-343, 2006.
DOI : 10.1007/s00446-005-0148-1

A. Mostefaoui, S. Rajsbaum, M. Raynal, and M. Roy, Condition-Based Protocols for Set Agreement Problems, Proc. 16th Int. Symposium on Distributed Computing (DISC'02), pp.46-62, 2002.
DOI : 10.1007/3-540-36108-1_4

A. Mostefaoui, S. Rajsbaum, M. Raynal, and M. Roy, Condition-based consensus solvability: a hierarchy of conditions and efficient protocols, Distributed Computing, vol.17, issue.1, pp.1-20, 2004.
DOI : 10.1007/s00446-003-0093-9

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 (SIROCCO'06), pp.182-196, 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. Raynal and C. Travers, Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems), 2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06), pp.267-274, 2006.
DOI : 10.1109/PRDC.2006.59

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

Y. Zibin, Condition-Based Consensus in Synchronous Systems, Proc. 17th Int. Symposium on Distributed Computing, pp.239-248, 2003.
DOI : 10.1007/978-3-540-39989-6_17