Pages that link to "Item:Q4909423"
From MaRDI portal
The following pages link to Counting-Based Impossibility Proofs for Renaming and Set Agreement (Q4909423):
Displaying 8 items.
- A non-topological proof for the impossibility of \(k\)-set agreement (Q391997) (← links)
- An equivariance theorem with applications to renaming (Q486986) (← links)
- Structure theory of flip graphs with applications to weak symmetry breaking (Q1659336) (← links)
- Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects (Q2802146) (← links)
- Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes (Q4608477) (← links)
- Bounds on the Step and Namespace Complexity of Renaming (Q4646446) (← links)
- Weak symmetry breaking and abstract simplex paths (Q5740661) (← links)
- Why Extension-Based Proofs Fail (Q6115415) (← links)
