Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
From MaRDI portal
Publication:1187030
DOI10.1016/0890-5401(92)90035-EzbMath0766.68002OpenAlexW2032783064MaRDI QIDQ1187030
Cynthia Dwork, Amotz Bar-Noy, Danny Dolev, H. Raymond Strong
Publication date: 28 June 1992
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(92)90035-e
Related Items (19)
The Byzantine Generals Problem in Generic and Wireless Networks ⋮ Visiting Byzantine Agreement underlying ad hoc environment ⋮ Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds ⋮ The Failure Discovery problem ⋮ On the number of authenticated rounds in Byzantine Agreement ⋮ Optimal algorithms for synchronous Byzantine \(k\)-set agreement ⋮ Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication ⋮ A new solution for the Byzantine agreement problem ⋮ Optimal time byzantine agreement for t <n/8 with linear-messages ⋮ ADAPTIVE DISTRIBUTED MUTUAL EXCLUSION BY DYNAMIC TOPOLOGY SWITCHING ⋮ Adaptive broadcast by fault-tolerant spanning tree switching ⋮ Modular construction of a Byzantine agreement protocol with optimal message bit complexity ⋮ Optimistically tuning synchronous Byzantine consensus: another win for null messages ⋮ Player-Centric Byzantine Agreement ⋮ Self-stabilizing Distributed Protocol Switching ⋮ Consensus algorithms with one-bit messages ⋮ On the round complexity of Byzantine agreement without initial set-up ⋮ Efficient agreement using fault diagnosis. ⋮ Distributed consensus revisited
Cites Work
This page was built for publication: Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
