Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds Piotr BermanJuan A. Garay OriginalPaper 22 February 2005 Pages: 3 - 19
A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment Amotz Bar-NoyDanny Dolev OriginalPaper 22 February 2005 Pages: 21 - 39
Message-optimal protocols for Byzantine Agreement Vassos HadzilacosJoseph Y. Halpern OriginalPaper 22 February 2005 Pages: 41 - 102
The Failure Discovery problem Vassos HadzilacosJoseph Y. Halpern OriginalPaper 22 February 2005 Pages: 103 - 129
Modular construction of an efficient 1-bit Byzantine agreement protocol Brian A. CoanJennifer L. Welch OriginalPaper 22 February 2005 Pages: 131 - 154