Principles of Distributed Systems
From MaRDI portal
Recommendations
Cited in
(26)- New hybrid fault models for asynchronous approximate agreement
- The computational power of distributed shared-memory models with bounded-size registers
- Asynchronous fully-decentralized SGD in the cluster-based model
- Brief announcement: Communication-optimal convex agreement
- All Byzantine agreement problems are expensive
- Multidimensional approximate agreement in Byzantine asynchronous systems
- Strong order-preserving renaming in the synchronous message passing model
- Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
- Approximate agreement under mobile Byzantine faults
- Byzantine approximate agreement on graphs
- Byzantine agreement with median validity
- Recent results on fault-tolerant consensus in message-passing networks
- A compiler that increases the fault tolerance of asynchronous protocols
- Fast multidimensional asymptotic and approximate consensus
- The computational power of distributed shared-memory models with bounded-size registers
- Genuinely distributed Byzantine machine learning
- Multidimensional agreement in Byzantine systems
- Wait-free approximate agreement on graphs
- Wait-free approximate agreement on graphs
- On the Validity of Consensus
- Reaching approximate agreement in the presence of faults
- Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions
- Exploiting omissive faults in synchronous approximate agreement
- Centroid approximation with multidimensional approximate agreement protocols
- Brief announcement: Reaching approximate consensus when everyone may crash
- Resilient-optimal interactive consistency in constant time
This page was built for publication: Principles of Distributed Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713668)
