[HTML][HTML] Reaching approximate Byzantine consensus with multi-hop communication
We are interested in approximate Byzantine consensus problem, wherein all the fault-free
processes reach consensus asymptotically (approximately in finite time). In particular, we …
processes reach consensus asymptotically (approximately in finite time). In particular, we …
Reaching approximate byzantine consensus with multi-hop communication
L Su, N Vaidya - … on Stabilization, Safety and Security of …, 2015 - experts.illinois.edu
We address the problem of reaching approximate consensus in the presence of Byzantine
faults in a synchronous system. We analyze iterative algorithms that maintain minimal state …
faults in a synchronous system. We analyze iterative algorithms that maintain minimal state …
[PDF][PDF] Reaching Approximate Byzantine Consensus with Multi-hop Communication
L Su, N Vaidya - 2014 - Citeseer
We address the problem of reaching consensus in the presence of Byzantine faults. Fault-
tolerant consensus algorithms typically assume knowledge of nonlocal information and multi …
tolerant consensus algorithms typically assume knowledge of nonlocal information and multi …
[PDF][PDF] Reaching Approximate Byzantine Consensus with Multi-hop Communication
L Su, N Vaidya - arXiv preprint arXiv:1411.5282, 2014 - researchgate.net
We address the problem of reaching consensus in the presence of Byzantine faults. Fault-
tolerant consensus algorithms typically assume knowledge of nonlocal information and multi …
tolerant consensus algorithms typically assume knowledge of nonlocal information and multi …
Reaching Approximate Byzantine Consensus with Multi-hop Communication
L Su, N Vaidya - arXiv e-prints, 2014 - ui.adsabs.harvard.edu
We address the problem of reaching consensus in the presence of Byzantine faults. In
particular, we are interested in investigating the impact of messages relay on the network …
particular, we are interested in investigating the impact of messages relay on the network …
[PDF][PDF] Reaching Approximate Byzantine Consensus with Multi-hop Communication
L Su, N Vaidya - 2014 - disc.ece.illinois.edu
We address the problem of reaching consensus in the presence of Byzantine faults. Fault-
tolerant consensus algorithms typically assume knowledge of nonlocal information and multi …
tolerant consensus algorithms typically assume knowledge of nonlocal information and multi …
Reaching approximate Byzantine consensus with multi-hop communication
L Su, NH Vaidya - Information and Computation, 2017 - infona.pl
We are interested in approximate Byzantine consensus problem, wherein all the fault-free
processes reach consensus asymptotically (approximately in finite time). In particular, we …
processes reach consensus asymptotically (approximately in finite time). In particular, we …
Reaching Approximate Byzantine Consensus with Multi-hop Communication
L Su, N Vaidya - Symposium on Self-Stabilizing Systems, 2015 - Springer
We address the problem of reaching approximate consensus in the presence of Byzantine
faults in a synchronous system. We analyze iterative algorithms that maintain minimal state …
faults in a synchronous system. We analyze iterative algorithms that maintain minimal state …
Reaching Approximate Byzantine Consensus with Multi-hop Communication
L Su, N Vaidya - arXiv preprint arXiv:1411.5282, 2014 - arxiv.org
We address the problem of reaching consensus in the presence of Byzantine faults. In
particular, we are interested in investigating the impact of messages relay on the network …
particular, we are interested in investigating the impact of messages relay on the network …
[引用][C] Reaching approximate Byzantine consensus with multi-hop communication
L Su, NH Vaidya - Information and Computation, 2017 - cir.nii.ac.jp