Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
This paper presents a polynomial-time protocol for reaching Byzantine agreement in t + 1 rounds whenever n > 3t, where n is the number of processors and t is an a priori upper bound on the number of failures. This resolves an open problem presented by Pease, Shostak, and Lamport in 1980. An early-stopping variant of this protocol is also presented, reaching agreement in a number of rounds that is proportional to the number of processors that actually fail.
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Michael D. Moffitt
ICCAD 2009