Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
From MaRDI portal
(Redirected from Publication:3524315)
Recommendations
- Renaming is weaker than set agreement but for perfect renaming: a map of sub-consensus tasks
- Brief announcement: There are plenty of tasks weaker than perfect renaming and stronger than set agreement
- Counting-based impossibility proofs for renaming and set agreement
- From Renaming to Set Agreement
- From adaptive renaming to set agreement
Cited in
(27)- From adaptive renaming to set agreement
- Renaming and the weakest family of failure detectors
- Bounded disagreement
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- An equivariance theorem with applications to renaming
- Renaming is weaker than set agreement but for perfect renaming: a map of sub-consensus tasks
- scientific article; zbMATH DE number 7228882 (Why is no real title available?)
- The Iterated Restricted Immediate Snapshot Model
- The topology of distributed adversaries
- Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus
- A non-topological proof for the impossibility of \(k\)-set agreement
- Power and limits of distributed computing shared memory models
- Bounds on the step and namespace complexity of renaming
- The renaming problem in shared memory systems: an introduction
- An equivariance theorem with applications to renaming
- Counting-based impossibility proofs for renaming and set agreement
- An inductive-style procedure for counting monochromatic simplexes of symmetric subdivisions with applications to distributed computing
- An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
- Untangling partial agreement: iterated \(x\)-consensus simulations
- From Renaming to Set Agreement
- A Sound Foundation for the Topological Approach to Task Solvability
- Brief announcement: There are plenty of tasks weaker than perfect renaming and stronger than set agreement
- The solvability of consensus in iterated models extended with safe-consensus
- Locally solvable tasks and the limitations of valency arguments
- An impossibility about failure detectors in the iterated immediate snapshot model
- New combinatorial topology bounds for renaming: the lower bound
- Anti-\(\Omega \): the weakest failure detector for set agreement
This page was built for publication: Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524315)
