Lower Bound on Number of Rounds. Theorem 17.20. A synchronous algorithm solving consensus in the presence of f crashing nodes needs at least f + 1 rounds, if nodes decide for the minimum seen value.
Appears in 3 contracts
Samples: Byzantine Agreement, Byzantine Agreement, Byzantine Agreement
Lower Bound on Number of Rounds. Theorem 17.203.20. A synchronous algorithm solving consensus in the presence of f crashing nodes needs at least f + 1 rounds, if nodes decide for the minimum seen value.
Appears in 2 contracts
Samples: Byzantine Agreement, Byzantine Agreement
Lower Bound on Number of Rounds. Theorem 17.2011.20. A synchronous algorithm solving consensus in the presence of f crashing nodes needs at least f + 1 rounds, if nodes decide for the minimum seen value.
Appears in 1 contract
Samples: Byzantine Agreement
Lower Bound on Number of Rounds. Theorem 17.2017.21. A synchronous algorithm solving consensus in the presence of f crashing nodes needs at least f + 1 rounds, if nodes decide for the minimum seen value.
Appears in 1 contract
Samples: Byzantine Agreement
