Unifying synchronous and asynchronous message-passing models
From MaRDI portal
Cited in
(23)- Power and limits of distributed computing shared memory models
- A topological treatment of early-deciding set-agreement
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
- Hundreds of impossibility results for distributed computing
- Untangling partial agreement: iterated \(x\)-consensus simulations
- Applications and Implications of a General Framework for Self-Stabilizing Overlay Networks
- An axiomatic approach to computing the connectivity of synchronous and asynchronous systems
- Structured Derivation of Semi-Synchronous Algorithms
- A bivalency proof of the lower bound for uniform consensus
- The Heard-Of model: computing in distributed systems with benign faults
- Tight bounds for k-set agreement with limited-scope failure detectors
- Byzantine lattice agreement in asynchronous systems
- A simple characterization of asynchronous computations
- Synchronous condition-based consensus
- scientific article; zbMATH DE number 7228882 (Why is no real title available?)
- The complexity of early deciding set agreement: how can topology help?
- An equivariance theorem with applications to renaming
- The Iterated Restricted Immediate Snapshot Model
- A Sound Foundation for the Topological Approach to Task Solvability
- Pseudospheres: combinatorics, topology and distributed systems
- The topology of local computing in networks
- The topology of distributed adversaries
- An equivariance theorem with applications to renaming
This page was built for publication: Unifying synchronous and asynchronous message-passing models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790108)
