A self-adjusting algorithm for Byzantine agreement
From MaRDI portal
Publication:1189860
DOI10.1007/BF02277668zbMath0744.68033MaRDI QIDQ1189860
Publication date: 27 September 1992
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02277668
68M10: Network design and communication in computer systems
Related Items
Cites Work
- A lower bound for the time to assure interactive consistency
- Stabilization and pseudo-stabilization
- Reaching approximate agreement in the presence of faults
- Bounds on information exchange for Byzantine agreement
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- An efficient algorithm for byzantine agreement without authentication