Fetching the paper…
Reading the bibliography…
Gradecast is a simple three-round algorithm presented by Feldman and Micali.
Reaching agreement in the presence of faults
M. Pease, R. Shostak, and L. Lamport · 1980
Earlier work this paper cites.
A Lower Bound for the Time to Assure Interactive Consistency
M.J. Fischer and N.A. Lynch · 1982
Earlier work this paper cites.
The byzantine generals problem
Leslie Lamport, Robert Shostak, and Marshall Pease · 1982
Earlier work this paper cites.
Reaching approximate agreement in the presence of faults
D. Dolev, N. A. Lynch, E. Stark, W. E. Weihl, and S. Pinter · 1986
Earlier work this paper cites.
Asymptotically optimal algorithms for approximate agreement
A. D. Fekete · 1986
Earlier work this paper cites.
Fast distributed agreement
S. Toueg, K. J. Perry, and T. K. Srikanth · 1987
Earlier work this paper cites.
Optimal algorithms for byzantine agreement
Paul Feldman and Silvio Micali · 1988
Cited alongside, same era.
Automatically increasing the fault-tolerance of distributed systems
Gil Neiger and Sam Toueg · 1988
Cited alongside, same era.
Early stopping in byzantine agreement
Danny Dolev, Ruediger Reischuk, and H. Raymond Strong · 1990
Cited alongside, same era.
Optimal amortized distributed consensus
A. Bar-Noy, X .Deng, J. Garay, and T. Kameda · 1995
Cited alongside, same era.
Distributed Algorithms
N. Lynch · 1996
Cited alongside, same era.
Fully polynomial byzantine agreement for n > 3 t n>3t processors in t + 1 t+1 rounds
J. A. Garay and Y. Moses · 1998
Cited alongside, same era.
Phd thesis
A. Zamsky · 1998
Later among the works it cites.
Detectable byzantine agreement secure against faulty majorities
M. Fitzi, D. Gottesman, M. Hirt, T. Holenstein, and A. Smith · 2002
Later among the works it cites.
Distributed Computing: Fundamentals, Simulations and Advanced Topics
H. Attiya and J. Welch · 2004
Later among the works it cites.
On expected constant-round protocols for byzantine agreement
Jonathan Katz and Chiu-Yuen Koo · 2006
Later among the works it cites.
An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience
Ittai Abraham, Danny Dolev, and Joseph Y. Halpern · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…