Pages that link to "Item:Q5415528"
From MaRDI portal
The following pages link to Global computation in a poorly connected world (Q5415528):
Displaying 18 items.
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication (Q1689748) (← links)
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits (Q2002052) (← links)
- Breaking the \(\log n\) barrier on rumor spreading (Q2075628) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- Rumor spreading with bounded in-degree (Q2292916) (← links)
- Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
- Simple, Fast and Deterministic Gossip and Rumor Spreading (Q3177753) (← links)
- Robustness of randomized rumour spreading (Q4993120) (← links)
- Limits for rumor spreading in stochastic populations (Q4993318) (← links)
- A tight analysis of the parallel undecided-state dynamics with two colors (Q5005128) (← links)
- (Q5075774) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- Probabilistic Analysis of Rumor-Spreading Time (Q5139858) (← links)
- Brief Announcement (Q5368972) (← links)
- Order optimal information spreading using algebraic gossip (Q5891123) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- Early adapting to trends: self-stabilizing information spread using passive communication (Q6658819) (← links)