Pages that link to "Item:Q2934354"
From MaRDI portal
The following pages link to New combinatorial topology upper and lower bounds for renaming (Q2934354):
Displaying 15 items.
- A non-topological proof for the impossibility of \(k\)-set agreement (Q391997) (← links)
- The renaming problem in shared memory systems: an introduction (Q465682) (← links)
- An equivariance theorem with applications to renaming (Q486986) (← links)
- Fully-adaptive algorithms for long-lived renaming (Q661054) (← links)
- New combinatorial topology bounds for renaming: the lower bound (Q992504) (← links)
- An algorithmic approach to the asynchronous computability theorem (Q1616400) (← links)
- Structure theory of flip graphs with applications to weak symmetry breaking (Q1659336) (← links)
- Renaming and the weakest family of failure detectors (Q1938384) (← links)
- A sharp threshold for the renameable-Horn and the \(q\)-Horn properties (Q2581546) (← links)
- An Equivariance Theorem with Applications to Renaming (Q2894460) (← links)
- Oblivious Collaboration (Q3095350) (← links)
- Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes (Q4608477) (← links)
- Upper bound on the complexity of solving hard renaming (Q5176094) (← links)
- An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing (Q5179018) (← links)
- The solvability of consensus in iterated models extended with safe-consensus (Q6056624) (← links)
