An O (log n ) expected rounds randomized byzantine generals protocol
From MaRDI portal
Publication:3768382
DOI10.1145/31846.42229zbMath0631.68023MaRDI QIDQ3768382
Publication date: 1987
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/31846.42229
parallel algorithms; fault tolerance; distributed algorithms; consensus protocols; Byzantine generals algorithms
68N25: Theory of operating systems
Related Items
Simultaneity is harder than agreement, The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols, On expected constant-round protocols for Byzantine agreement, Local majorities, coalitions and monopolies in graphs: A review, Dynamic monopolies of constant size