Fast Distributed Agreement
From MaRDI portal
Publication:3801050
DOI10.1137/0216031zbMath0654.68016OpenAlexW1983536842MaRDI QIDQ3801050
T. K. Srikanth, Sam Toueg, Kenneth J. Perry
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0216031
Related Items (11)
Invited talk: Resilient distributed algorithms ⋮ Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds ⋮ Total ordering algorithms for asynchronous Byzantine systems ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Constant-Space Localized Byzantine Consensus ⋮ On the impact of link faults on Byzantine agreement ⋮ Player-Centric Byzantine Agreement ⋮ Efficient algorithms for anonymous Byzantine agreement ⋮ Consensus algorithms with one-bit messages ⋮ Byzantine-resistant total ordering algorithms. ⋮ Efficient agreement using fault diagnosis.
This page was built for publication: Fast Distributed Agreement
