Byzantine agreement in polynomial expected time
From MaRDI portal
Publication:5495810
DOI10.1145/2488608.2488658zbMath1293.68056OpenAlexW1998351878MaRDI QIDQ5495810
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2488608.2488658
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20)
Related Items (3)
On the round complexity of randomized Byzantine agreement ⋮ On the complexity of asynchronous agreement against powerful adversaries ⋮ An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model
This page was built for publication: Byzantine agreement in polynomial expected time
