Fast Distributed Agreement
From MaRDI portal
Publication:3801050
DOI10.1137/0216031zbMath0654.68016MaRDI 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
68N99: Theory of software
Related Items
Total ordering algorithms for asynchronous Byzantine systems, Distributed CONGEST Algorithms against Mobile Adversaries, On the impact of link faults on Byzantine agreement, Consensus algorithms with one-bit messages, Invited talk: Resilient distributed algorithms, Efficient agreement using fault diagnosis., Byzantine-resistant total ordering algorithms., Efficient algorithms for anonymous Byzantine agreement, Player-Centric Byzantine Agreement, Constant-Space Localized Byzantine Consensus, Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds