Pages that link to "Item:Q287985"
From MaRDI portal
The following pages link to Simple and optimal randomized fault-tolerant rumor spreading (Q287985):
Displaying 8 items.
- Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Q661066) (← links)
- Gossiping by processors prone to omission failures (Q976104) (← links)
- On fast and robust information spreading in the vertex-congest model (Q1625611) (← links)
- Asymptotically optimal randomized rumor spreading (Q2857362) (← links)
- Faster Rumor Spreading: Breaking the logn Barrier (Q2920965) (← links)
- Spreading Rumors Rapidly Despite an Adversary (Q4386454) (← links)
- Meeting the deadline (Q5176203) (← links)
- On the Push&Pull Protocol for Rumor Spreading (Q5346546) (← links)