Pages that link to "Item:Q673104"
From MaRDI portal
The following pages link to Tight bounds on the round complexity of distributed 1-solvable tasks (Q673104):
Displaying 4 items.
- Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures (Q987393) (← links)
- A combinatorial characterization of the distributed 1-solvable tasks (Q3485850) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Algebraic topology and distributed computing (Q6620125) (← links)