Iterative approximate Byzantine consensus in arbitrary directed graphs
From MaRDI portal
(Redirected from Iterative approximate Byzantine consensus in arbitrary directed graphs)
Iterative approximate Byzantine consensus in arbitrary directed graphs (scientific article; zbMATH DE number 7909895)
Iterative approximate Byzantine consensus in arbitrary directed graphs (scientific article; zbMATH DE number 7909895)
Cites work
- Agreement in synchronous networks with ubiquitous faults
- Approximate consensus in highly dynamic networks: the role of averaging algorithms
- Asynchronous convex hull consensus in the presence of crash faults
- Byzantine vector consensus in complete graphs
- Consensus in networked multi-agent systems with adversaries
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 3135399 (Why is no real title available?)
- scientific article; zbMATH DE number 7561259 (Why is no real title available?)
- Impossibility of distributed consensus with one faulty process
- Iterative approximate Byzantine consensus in arbitrary directed graphs
- Low complexity resilient consensus in networked multi-agent systems with adversaries
- Products of Indecomposable, Aperiodic, Stochastic Matrices
- Reaching approximate agreement in the presence of faults
- Reaching approximate Byzantine consensus with multi-hop communication
- The Byzantine Generals Problem
- The Heard-Of model: computing in distributed systems with benign faults
- Tight Bounds for Asymptotic and Approximate Consensus
- Time is not a healer (preliminary version)
- Tolerating corrupted communication
This page was built for publication: Iterative approximate Byzantine consensus in arbitrary directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601209)