Fast asynchronous Byzantine agreement and leader election with full information

DOI10.1145/1824777.1824788zbMath1300.68012OpenAlexW2160685416MaRDI QIDQ2930350

Jared Saia, David Kempe, Vishal Sanwalani, Bruce M. Kapron, Valerie King

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1824777.1824788

zbMATH Keywords

probabilistic methodMonte Carlo algorithmsdistributed algorithmsByzantine agreementasynchronous communication

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (5)

Sublinear-round Byzantine agreement under corrupt majority ⋮ The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement ⋮ Leader Election in Sparse Dynamic Networks with Churn ⋮ Unnamed Item ⋮ Distributed agreement in dynamic peer-to-peer networks

This page was built for publication: Fast asynchronous Byzantine agreement and leader election with full information