Conference paper
(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
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.
Eric Price, David P. Woodruff
FOCS 2011
Limin Hu
IEEE/ACM Transactions on Networking
John M. Boyer, Charles F. Wiecha
DocEng 2009
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking