Multidimensional agreement in Byzantine systems
From MaRDI portal
Recommendations
- Multidimensional approximate agreement in Byzantine asynchronous systems
- Byzantine agreement with homonyms in synchronous systems
- Byzantine agreement with a rational adversary
- A characterization of eventual Byzantine agreement
- P systems and the Byzantine agreement
- Optimally efficient multi-valued byzantine agreement
- On the composition of authenticated Byzantine Agreement
- scientific article; zbMATH DE number 7774268
Cites work
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 1179121 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- A Generalization of Radon's Theorem
- Algorithms for center and Tverberg points
- Approximate centerpoints with proofs
- Approximating Tverberg points in linear time for any fixed dimension
- Asynchronous byzantine agreement protocols
- Basic Geometry of Voting
- Byzantine vector consensus in complete graphs
- Computing a centerpoint of a finite planar set of points in linear time
- Early stopping in Byzantine agreement
- Easy impossibility proofs for distributed consensus problems
- Impossibility of distributed consensus with one faulty process
- Multidimensional approximate agreement in Byzantine asynchronous systems
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
- Principles of Distributed Systems
- Reaching approximate agreement in the presence of faults
- Some variations on Tverberg's theorem
- The Byzantine Generals Problem
Cited in
(18)- Multidimensional approximate agreement in Byzantine asynchronous systems
- Brief Announcement: Byzantine Geoconsensus
- Approximate agreement under mobile Byzantine faults
- Byzantine approximate agreement on graphs
- Asynchronous fully-decentralized SGD in the cluster-based model
- Relaxed Byzantine vector consensus
- Fast multidimensional asymptotic and approximate consensus
- Byzantine vector consensus in complete graphs
- Simplicial models for the epistemic logic of faulty agents
- Secure consensus with distributed detection via two-hop communication
- Asynchronous convex hull consensus in the presence of crash faults
- Genuinely distributed Byzantine machine learning
- Wait-free approximate agreement on graphs
- Wait-free approximate agreement on graphs
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- Resilient distributed vector consensus using centerpoint
- Byzantine preferential voting
- Multidimensional Byzantine agreement in a synchronous setting
This page was built for publication: Multidimensional agreement in Byzantine systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901876)