Multidimensional approximate agreement in Byzantine asynchronous systems
From MaRDI portal
Publication:5495809
DOI10.1145/2488608.2488657zbMath1293.68060OpenAlexW2010107859WikidataQ60305003 ScholiaQ60305003MaRDI QIDQ5495809
Hammurabi Mendes, Maurice P. Herlihy
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2488608.2488657
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)
Related Items (9)
Secure multi-dimensional consensus algorithm against malicious attacks ⋮ Byzantine preferential voting ⋮ Multidimensional agreement in Byzantine systems ⋮ On the Validity of Consensus ⋮ Approximate agreement under mobile Byzantine faults ⋮ Resilient output regulation in heterogeneous networked systems under Byzantine agents ⋮ 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: Multidimensional approximate agreement in Byzantine asynchronous systems
