Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model

DOI10.1145/3293611.3331619OpenAlexW2963912117MaRDI QIDQ5145230

Nitin H. Vaidya, Muhammad Samir Khan, Syed Shalan Naqvi

Publication date: 20 January 2021

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

Full work available at URL: https://arxiv.org/abs/1903.11677

zbMATH Keywords

reliabilityself-organizationfault-toleranceself-stabilizationcomplexity and impossibility results for distributed computing

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

Synchronous \(t\)-resilient consensus in arbitrary graphs ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Testing equality under the local broadcast model

This page was built for publication: Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model