An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time
From MaRDI portal
Publication:2942733
DOI10.1145/248052.248091zbMath1321.68095OpenAlexW2063774558MaRDI QIDQ2942733
Publication date: 11 September 2015
Published in: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/248052.248091
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15)
Related Items (2)
Optimal time byzantine agreement for t <n/8 with linear-messages ⋮ Randomized protocols for asynchronous consensus
This page was built for publication: An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time
