Pages that link to "Item:Q4210118"
From MaRDI portal
The following pages link to Performing Work Efficiently in the Presence of Faults (Q4210118):
Displaying 20 items.
- Dealing with undependable workers in decentralized network supercomputing (Q477093) (← links)
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems (Q666160) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- Dynamic load balancing with group communication (Q861278) (← links)
- Locating and repairing faults in a network with mobile agents (Q962168) (← links)
- A robust randomized algorithm to perform independent tasks (Q1002110) (← links)
- The Do-All problem with Byzantine processor failures (Q1770376) (← links)
- Cooperative computing with fragmentable and mergeable groups (Q1827289) (← links)
- Ordered and delayed adversaries and how to work against them on a shared channel (Q2010599) (← links)
- The assignment problem (Q2232588) (← links)
- Distributed scheduling for disconnected cooperation (Q2375304) (← links)
- Performing work in broadcast networks (Q2375307) (← links)
- Efficient gossip and robust distributed computation (Q2576871) (← links)
- Performing work with asynchronous processors: Message-delay-sensitive bounds (Q2581537) (← links)
- Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts (Q3095325) (← links)
- RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS (Q3144930) (← links)
- Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond (Q3181039) (← links)
- (Q4736930) (← links)
- Performing tasks on synchronous restartable message-passing processors (Q5138349) (← links)
