A Simple Proof of the Uniform Consensus Synchronous Lower Bound.
In Information Processing Letters (IPL) 85(1), pages 47-52, January 2003.
We give a simple and intuitive proof of a f+2 round lower bound for
uniform consensus. That is, we show that for every uniform consensus
algorithm tolerating t failures, and for every f <
t-1, there is an execution with f failures that requires
Preprint of IPL paper:
Talk slides (powerpoint):
Last modified: Sun Dec 29 13:15:07 IST 2002