Pages that link to "Item:Q5248476"
From MaRDI portal
The following pages link to Wait-free <i>k</i>-set agreement is impossible (Q5248476):
Displaying 18 items.
- On set consensus numbers (Q661057) (← links)
- Iterated chromatic subdivisions are collapsible (Q891921) (← links)
- Classifying rendezvous tasks of arbitrary dimension (Q1019731) (← links)
- An algorithmic approach to the asynchronous computability theorem (Q1616400) (← links)
- Geometric and combinatorial views on asynchronous computability (Q1657197) (← links)
- A classification of wait-free loop agreement tasks (Q1870526) (← links)
- A computationally intractable problem on simplicial complexes (Q1917045) (← links)
- Renaming and the weakest family of failure detectors (Q1938384) (← links)
- The evolution of non-degenerate and degenerate rendezvous tasks (Q2315309) (← links)
- On the weakest failure detector ever (Q2377264) (← links)
- Closed schedulers: a novel technique for analyzing asynchronous protocols (Q5136996) (← links)
- The BG distributed simulation algorithm (Q5138357) (← links)
- An adaptive collect algorithm with applications (Q5138374) (← links)
- An Introduction to the Topological Theory of Distributed Computing with Safe-consensus (Q5179019) (← links)
- A Sound Foundation for the Topological Approach to Task Solvability (Q5875396) (← links)
- A topological perspective on distributed network algorithms (Q5919043) (← links)
- Communication pattern logic: epistemic and topological views (Q6054065) (← links)
- Wait-free computing (Q6062513) (← links)
