The following pages link to (Q3579453):
Displaying 20 items.
- Randomised broadcasting: memory vs. randomness (Q391757) (← links)
- The worst case behavior of randomized gossip protocols (Q477180) (← links)
- Rumor spreading in social networks (Q541666) (← links)
- Messy broadcasting - decentralized broadcast schemes with limited knowledge (Q628314) (← links)
- Spreading of messages in random graphs (Q633767) (← links)
- Spreading messages (Q1029342) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- Quasi-random rumor spreading: reducing randomness can be costly (Q1944078) (← links)
- Breaking the \(\log n\) barrier on rumor spreading (Q2075628) (← links)
- Communication complexity of quasirandom rumor spreading (Q2354024) (← links)
- Direction-reversing quasi-random rumor spreading with restarts (Q2445336) (← links)
- Abelian Networks I. Foundations and Examples (Q2804993) (← links)
- Quasirandom Rumor Spreading on Expanders (Q2851470) (← links)
- A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading (Q2851485) (← links)
- Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting (Q2851516) (← links)
- (Q2857362) (← links)
- Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
- Asymptotically Optimal Randomized Rumor Spreading (Q3012944) (← links)
- Fast Simulation of Large-Scale Growth Models (Q3088126) (← links)
- The Range of a Rotor Walk (Q4576529) (← links)