Pages that link to "Item:Q5138503"
From MaRDI portal
The following pages link to The complexity of synchronous iterative Do-All with crashes (Q5138503):
Displaying 6 items.
- Doing-it-all with bounded work and communication (Q529041) (← links)
- A robust randomized algorithm to perform independent tasks (Q1002110) (← links)
- The Do-All problem with Byzantine processor failures (Q1770376) (← links)
- Online parallel scheduling of non-uniform tasks: trading failures for energy (Q2348044) (← links)
- Efficient gossip and robust distributed computation (Q2576871) (← links)
- Algebraic topology and distributed computing (Q6620125) (← links)
