Multidimensional approximate agreement in Byzantine asynchronous systems
DOI10.1145/2488608.2488657zbMATH Open1293.68060OpenAlexW2010107859WikidataQ60305003 ScholiaQ60305003MaRDI QIDQ5495809FDOQ5495809
Authors: Hammurabi Mendes, Maurice Herlihy 
Publication date: 7 August 2014
Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2488608.2488657
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14) Network protocols (68M12)
Cited In (15)
- Defending non-Bayesian learning against adversarial attacks
- Principles of Distributed Systems
- Managed agreement: generalizing two fundamental distributed agreement problems
- Brief Announcement: Byzantine Geoconsensus
- Approximate agreement under mobile Byzantine faults
- Byzantine approximate agreement on graphs
- Secure multi-dimensional consensus algorithm against malicious attacks
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
- On the Validity of Consensus
- Multidimensional agreement in Byzantine systems
- Resilient output regulation in heterogeneous networked systems under Byzantine agents
- Reaching approximate agreement in the presence of faults
- Mutual information agreement in multicomputer systems with the detection and identification of Byzantine faults
- Byzantine preferential voting
- Resilient multi-dimensional consensus in adversarial environment
This page was built for publication: Multidimensional approximate agreement in Byzantine asynchronous systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495809)
