Reaching approximate Byzantine consensus with multi-hop communication
From MaRDI portal
Publication:2013588
DOI10.1016/j.ic.2016.12.003zbMath1371.68029arXiv1411.5282OpenAlexW2559853601MaRDI QIDQ2013588
Publication date: 8 August 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.5282
Related Items (7)
Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions ⋮ Secure consensus with distributed detection via two-hop communication ⋮ Resilient consensus in continuous-time networks with \(\ell\)-hop communication and time delay ⋮ Resilient consensus for multi-agent systems subject to differential privacy requirements ⋮ Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming ⋮ Defending non-Bayesian learning against adversarial attacks ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Easy impossibility proofs for distributed consensus problems
- Fault-Tolerant Consensus in Directed Graphs
- Iterative approximate byzantine consensus in arbitrary directed graphs
- Reaching approximate agreement in the presence of faults
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- Reaching a Consensus
- Reaching Approximate Byzantine Consensus with Multi-hop Communication
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Products of Indecomposable, Aperiodic, Stochastic Matrices
This page was built for publication: Reaching approximate Byzantine consensus with multi-hop communication