Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
From MaRDI portal
(Redirected from Publication:5176092)
Recommendations
Cited in
(12)- On the strongest message adversary for consensus in directed dynamic networks
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Consensus in rooted dynamic networks with short-lived stability
- A characterization of oblivious message adversaries for which consensus is solvable
- A simple characterization of asynchronous computations
- Characterizing Consensus in the Heard-Of Model
- What can be computed in a distributed system?
- Untangling partial agreement: iterated \(x\)-consensus simulations
- On the inherent weakness of conditional synchronization primitives
- Asynchronous Byzantine reliable broadcast with a message adversary
- Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
- Topological characterization of consensus in distributed systems
This page was built for publication: Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176092)