Fault-Tolerant Consensus in Directed Graphs

DOI10.1145/2767386.2767399zbMath1333.68072OpenAlexW2112337480MaRDI QIDQ2796282

Nitin H. Vaidya, Lewis Tseng

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

asynchronous systemssynchronous systemsByzantine faultsdirected networkscrash-tolerant consensus

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (9)

Global and fixed-terminal cuts in digraphs ⋮ Secure consensus with distributed detection via two-hop communication ⋮ Randomized transmission protocols for protection against jamming attacks in multi-agent consensus ⋮ Synchronous \(t\)-resilient consensus in arbitrary graphs ⋮ Reaching approximate Byzantine consensus with multi-hop communication ⋮ Unnamed Item ⋮ Reaching Approximate Byzantine Consensus with Multi-hop Communication ⋮ On the computational complexity of the secure state-reconstruction problem ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

Cites Work

• Memorization and Association on a Realistic Neural Model
• Unnamed Item

This page was built for publication: Fault-Tolerant Consensus in Directed Graphs