Pages that link to "Item:Q3177753"
From MaRDI portal
The following pages link to Simple, Fast and Deterministic Gossip and Rumor Spreading (Q3177753):
Displaying 18 items.
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- The worst case behavior of randomized gossip protocols (Q477180) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- On fast and robust information spreading in the vertex-congest model (Q1625611) (← links)
- Global stability of a two-mediums rumor spreading model with media coverage (Q2147682) (← links)
- Rumor spreading with bounded in-degree (Q2292916) (← links)
- Dynamic gossip (Q2415893) (← links)
- Everyone knows that everyone knows (Q2658278) (← links)
- Discovery through gossip (Q2811164) (← links)
- Social networks spread rumors in sublogarithmic time (Q2857363) (← links)
- Low randomness rumor spreading via hashing (Q2904772) (← links)
- Gossiping in a Multi-channel Radio Network (Q3523209) (← links)
- Robustness of randomized rumour spreading (Q4993120) (← links)
- (Q5075774) (← links)
- (Q5090922) (← links)
- Meeting the deadline (Q5176203) (← links)
- Asynchronous gossip (Q5395710) (← links)
- Fast distributed algorithms for LP-type problems of low dimension (Q6487540) (← links)