Pages that link to "Item:Q5361424"
From MaRDI portal
The following pages link to Set consensus using arbitrary objects (preliminary version) (Q5361424):
Displaying 16 items.
- The topology of distributed adversaries (Q360277) (← links)
- A non-topological proof for the impossibility of \(k\)-set agreement (Q391997) (← links)
- A classification of wait-free loop agreement tasks (Q1870526) (← links)
- Bounded disagreement (Q2182645) (← links)
- On the computability power and the robustness of set agreement-oriented failure detector classes (Q2377255) (← links)
- Algebraic topology and concurrency (Q2500494) (← links)
- Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects (Q2802146) (← links)
- An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems (Q2810958) (← links)
- Schlegel Diagram and Optimizable Immediate Snapshot Protocol (Q3300823) (← links)
- The BG distributed simulation algorithm (Q5138357) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- A Sound Foundation for the Topological Approach to Task Solvability (Q5875396) (← links)
- A topological perspective on distributed network algorithms (Q5919043) (← links)
- Wait-free computing (Q6062513) (← links)
- The combinatorial structure of wait-free solvable tasks (extended abstract) (Q6570926) (← links)
- Defining logical obstruction with fixpoints in epistemic logic (Q6645916) (← links)
