Fast byzantine agreement in dynamic networks

DOI10.1145/2484239.2484275zbMath1323.68550OpenAlexW2119741407MaRDI QIDQ5176084

Peter Robinson, Gopal Pandurangan, John E. Augustine

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

randomized algorithmdistributed algorithmdynamic networkByzantine agreementexpander graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (9)

Some lower bounds in dynamic networks with oblivious adversaries ⋮ Distributed exploration of dynamic rings ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks ⋮ Unnamed Item ⋮ Discovery Through Gossip ⋮ Leader Election in Sparse Dynamic Networks with Churn ⋮ Distributed computation in dynamic networks via random walks ⋮ Distributed agreement in dynamic peer-to-peer networks

This page was built for publication: Fast byzantine agreement in dynamic networks