Pages that link to "Item:Q4376186"
From MaRDI portal
The following pages link to Algorithms for the Certified Write-All Problem (Q4376186):
Displayed 10 items.
- Solving the at-most-once problem with nearly optimal effectiveness (Q391254) (← links)
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems (Q666160) (← links)
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634) (← 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)
- Performing work with asynchronous processors: Message-delay-sensitive bounds (Q2581537) (← links)
- Oblivious Collaboration (Q3095350) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- The complexity of synchronous iterative Do-All with crashes (Q5138503) (← links)