Byzantine vector consensus in complete graphs
From MaRDI portal
Publication:5176083
DOI10.1145/2484239.2484256zbMath1323.68037arXiv1302.2543OpenAlexW2084279514WikidataQ60305002 ScholiaQ60305002MaRDI QIDQ5176083
Vijay K. Garg, Nitin H. Vaidya
Publication date: 2 March 2015
Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.2543
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (9)
Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey ⋮ Byzantine preferential voting ⋮ Multidimensional agreement in Byzantine systems ⋮ On the Validity of Consensus ⋮ Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming ⋮ Resilient distributed vector consensus using centerpoint ⋮ Defending non-Bayesian learning against adversarial attacks ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks ⋮ Resilient multi-dimensional consensus in adversarial environment
This page was built for publication: Byzantine vector consensus in complete graphs
