The following pages link to (Q4437132):
Displaying 8 items.
- Dealing with undependable workers in decentralized network supercomputing (Q477093) (← links)
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- The Do-All problem with Byzantine processor failures (Q1770376) (← links)
- Ordered and delayed adversaries and how to work against them on a shared channel (Q2010599) (← 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)
