Principles of Distributed Systems

DOI10.1007/b138689zbMath1129.68579OpenAlexW2486699168MaRDI QIDQ5713668

Ittai Abraham, Danny Dolev, Yonatan Amit

Publication date: 15 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b138689

zbMATH Keywords

asynchronous systemsByzantine agreementapproximate agreement

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (9)

Genuinely distributed Byzantine machine learning ⋮ Reaching consensus for asynchronous distributed key generation ⋮ Multidimensional agreement in Byzantine systems ⋮ On the Validity of Consensus ⋮ Strong order-preserving renaming in the synchronous message passing model ⋮ Wait-free approximate agreement on graphs ⋮ Wait-free approximate agreement on graphs ⋮ Fast Multidimensional Asymptotic and Approximate Consensus ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

This page was built for publication: Principles of Distributed Systems