Reaching approximate Byzantine consensus with multi-hop communication
DOI10.1007/978-3-319-21741-3_2zbMATH Open1428.68082OpenAlexW1946818232MaRDI QIDQ5207895FDOQ5207895
Authors: Lili Su, Nitin H. Vaidya 
Publication date: 14 January 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21741-3_2
Recommendations
- Reaching approximate Byzantine consensus with multi-hop communication
- Iterative approximate Byzantine consensus in arbitrary directed graphs
- Iterative approximate Byzantine consensus under a generalized fault model
- An improved approximate consensus algorithm in the presence of mobile faults
- Reaching approximate agreement in the presence of faults
iterative algorithmsynchronous systemincomplete networkbounded-length communication pathsapproximate Byzantine consensus
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cites Work
- Introduction to algorithms
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- Reaching approximate agreement in the presence of faults
- Easy impossibility proofs for distributed consensus problems
- Iterative approximate Byzantine consensus in arbitrary directed graphs
- Fault-tolerant consensus in directed graphs
- Reaching approximate Byzantine consensus with multi-hop communication
Cited In (9)
- An improved approximate consensus algorithm in the presence of mobile faults
- Title not available (Why is that?)
- Reaching approximate Byzantine consensus with multi-hop communication
- Approximate agreement under mobile Byzantine faults
- Iterative approximate Byzantine consensus under a generalized fault model
- Reaching approximate Byzantine consensus with multi-hop communication
- Iterative approximate Byzantine consensus in arbitrary directed graphs
- Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions
- Iterative approximate Byzantine consensus in arbitrary directed graphs
This page was built for publication: Reaching approximate Byzantine consensus with multi-hop communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207895)
