Pages that link to "Item:Q3524315"
From MaRDI portal
The following pages link to Subconsensus Tasks: Renaming Is Weaker Than Set Agreement (Q3524315):
Displaying 22 items.
- The topology of distributed adversaries (Q360277) (← links)
- A non-topological proof for the impossibility of \(k\)-set agreement (Q391997) (← links)
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- The renaming problem in shared memory systems: an introduction (Q465682) (← links)
- An equivariance theorem with applications to renaming (Q486986) (← links)
- An impossibility about failure detectors in the iterated immediate snapshot model (Q975436) (← links)
- New combinatorial topology bounds for renaming: the lower bound (Q992504) (← links)
- Anti-\(\Omega \): the weakest failure detector for set agreement (Q992506) (← links)
- From adaptive renaming to set agreement (Q1008730) (← links)
- Renaming and the weakest family of failure detectors (Q1938384) (← links)
- Bounded disagreement (Q2182645) (← links)
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects (Q2802146) (← links)
- An Equivariance Theorem with Applications to Renaming (Q2894460) (← links)
- (Q3305190) (← links)
- The Iterated Restricted Immediate Snapshot Model (Q3511360) (← links)
- Bounds on the Step and Namespace Complexity of Renaming (Q4646446) (← links)
- An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing (Q5179018) (← links)
- An Introduction to the Topological Theory of Distributed Computing with Safe-consensus (Q5179019) (← links)
- Untangling Partial Agreement: Iterated x-consensus Simulations (Q5207909) (← links)
- From Renaming to Set Agreement (Q5425961) (← links)
- A Sound Foundation for the Topological Approach to Task Solvability (Q5875396) (← links)
- The solvability of consensus in iterated models extended with safe-consensus (Q6056624) (← links)
