Pages that link to "Item:Q5395676"
From MaRDI portal
The following pages link to New combinatorial topology bounds for renaming (Q5395676):
Displayed 15 items.
- Linear space bootstrap communication schemes (Q477099) (← links)
- An equivariance theorem with applications to renaming (Q486986) (← links)
- All binomial identities are orderable (Q730270) (← links)
- Iterated chromatic subdivisions are collapsible (Q891921) (← 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 visit to mutual exclusion in seven dates (Q2136281) (← links)
- Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects (Q2802146) (← links)
- Tight Bounds for Asynchronous Renaming (Q3189653) (← 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)
- What Can be Computed in a Distributed System? (Q5170751) (← links)
- A topological perspective on distributed network algorithms (Q5919043) (← links)
- Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6044459) (← links)
- The solvability of consensus in iterated models extended with safe-consensus (Q6056624) (← links)