Pages that link to "Item:Q1189859"
From MaRDI portal
The following pages link to Efficient parallel algorithms can be made robust (Q1189859):
Displaying 16 items.
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Reliable computations on faulty EREW PRAM (Q671425) (← links)
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634) (← links)
- Fault-tolerant sequential scan (Q841615) (← links)
- Achieving optimal CRCW PRAM fault-tolerance (Q1182119) (← links)
- Locality-preserving hash functions for general purpose parallel computation (Q1333434) (← links)
- Efficient execution of nondeterministic parallel programs on asynchronous systems (Q1383149) (← links)
- Ordered and delayed adversaries and how to work against them on a shared channel (Q2010599) (← links)
- The assignment problem (Q2232588) (← links)
- Performing work in broadcast networks (Q2375307) (← links)
- Efficient gossip and robust distributed computation (Q2576871) (← links)
- Efficient parallel computing with memory faults (Q5055934) (← links)
- Performing tasks on synchronous restartable message-passing processors (Q5138349) (← links)
- An algorithm for the asynchronous Write-All problem based on process collision (Q5138352) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- The complexity of synchronous iterative Do-All with crashes (Q5138503) (← links)
