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

M. K. Aguilera, L. Lann, G. Toueg, and S. , On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems, Proc. 16th Symposium on Distributed Computing (DISC'02), pp.354-369, 2002.
DOI : 10.1007/3-540-36108-1_24

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

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

B. Charron-bost and A. Schiper, Uniform consensus is harder than consensus, Journal of Algorithms, vol.51, issue.1, pp.15-37, 2004.
DOI : 10.1016/j.jalgor.2003.11.001

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

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=10.1.1.117.5266

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, Round-by-round Fault Detectors: Unifying Synchrony and Asynchrony, Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC'00), A CM Press, pp.143-152, 1998.
DOI : 10.1145/277697.277724

E. Gafni, R. Guerraoui, and B. Pochon, From a Static Impossibility to an Adaptive L o wer Bound: The Complexity of Early Deciding Set Agreement, Proc. 37th ACM Sympo s i u m o n T h e ory of Computing, pp.714-722, 2005.

M. P. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991.
DOI : 10.1145/114005.102808

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.

M. P. Herlihy and S. Rajsbaum, Algebraic spans, Mathematical Structures in Computer Science, vol.10, issue.4, pp.549-573, 2000.
DOI : 10.1017/S0960129500003170

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

L. Lamport and M. Fischer, Byzantine Generals and Transaction Commit Protocols. Unpublished manuscript, 16 pages, 1982.

N. A. Lynch, Distributed Algorithms, 1996.

A. Most, 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.

A. Most, S. Rajsbaum, and M. Raynal, The Combined Power of Conditions and Failure Detectors to Solve Asynchronous Set Agreement, Proc. 24th ACM Symposium on Principles of Distributed Computing (PODC'00), pp.179-188, 2005.

A. Most, S. Rajsbaum, and M. Raynal, Synchronous Condition-Based Consensus, Distributed Computing, vol.18, issue.5, pp.325-343, 2006.

A. Most and M. Raynal, k-Set Agreement with Limited Accuracy Failure Detectors, Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC'00), A CM Press, pp.143-152, 2000.

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 (with open problems), Proc. 12th Int'l IEEE Paciic Rim Dependable Computing Symposium (PRDC'2006), pp.267-274, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00001158

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

N. Santoro, Design and Analysis of Distributed Algorithms, Wiley Series on Parallel and Distributed Computing, 2007.
DOI : 10.1002/0470072644

X. Wang, Y. M. Teo, and J. Cao, A bivalency proof of the lower bound for uniform consensus, Information Processing Letters, vol.96, issue.5, pp.167-174, 2005.
DOI : 10.1016/j.ipl.2005.08.002