Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
From MaRDI portal
Publication:4304063
DOI10.1006/jagm.1994.1029zbMath0822.68045OpenAlexW2082129855MaRDI QIDQ4304063
Publication date: 8 September 1994
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1994.1029
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)
Related Items (9)
Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds ⋮ The Failure Discovery problem ⋮ Optimal time byzantine agreement for t <n/8 with linear-messages ⋮ Modular construction of a Byzantine agreement protocol with optimal message bit complexity ⋮ Optimistically tuning synchronous Byzantine consensus: another win for null messages ⋮ Consensus algorithms with one-bit messages ⋮ Simultaneity is harder than agreement ⋮ On the round complexity of Byzantine agreement without initial set-up ⋮ Efficient agreement using fault diagnosis.
This page was built for publication: Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
