Iterative approximate Byzantine consensus in arbitrary directed graphs
- 22 May 2024
- journal article
- research article
- Published by Springer Nature in Distributed Computing
- Vol. 37 (3) , 225-246
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (CNS 1059540)
- Army Research Office (W-911-NF-0710287)
This publication has 29 references indexed in Scilit:
- Reaching Approximate Byzantine Consensus with Multi-hop Communication2015
- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms2015
- Iterative Byzantine Vector Consensus in Incomplete Graphs2014
- Robustness of complex networks with implications for consensus and contagion2012
- The Heard-Of model: computing in distributed systems with benign faultsDistributed Computing, 2009
- Agreement in synchronous networks with ubiquitous faultsTheoretical Computer Science, 2007
- Distributed Computing2004
- Time is not a healer1989
- Products of indecomposable, aperiodic, stochastic matricesProceedings of the American Mathematical Society, 1963
- Weak ergodicity in non-homogeneous Markov chainsMathematical Proceedings of the Cambridge Philosophical Society, 1958