Pages that link to "Item:Q2576871"
From MaRDI portal
The following pages link to Efficient gossip and robust distributed computation (Q2576871):
Displaying 16 items.
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Q661066) (← links)
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems (Q666160) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- Parallel algorithms for gossiping by mail (Q911271) (← links)
- Two phase gossip: Managing distributed event histories (Q918658) (← links)
- Gossiping by processors prone to omission failures (Q976104) (← links)
- A robust randomized algorithm to perform independent tasks (Q1002110) (← links)
- Ordered and delayed adversaries and how to work against them on a shared channel (Q2010599) (← links)
- Almost-optimal gossip-based aggregate computation (Q2910849) (← links)
- Optimal gossip with direct addressing (Q2943620) (← links)
- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) (Q3587432) (← links)
- Fast gossiping on mesh-bus computers (Q4420815) (← links)
- Broadcast Gossip Algorithms for Consensus (Q4569760) (← links)
- (Q5015383) (← links)
- Distributed Computing (Q5897410) (← links)