Pages that link to "Item:Q5891998"
From MaRDI portal
The following pages link to Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems (Q5891998):
Displaying 15 items.
- Randomised broadcasting: memory vs. randomness (Q391757) (← links)
- The worst case behavior of randomized gossip protocols (Q477180) (← links)
- Perfect broadcasting in unlabeled networks (Q1270770) (← links)
- Probabilistic flooding for efficient information dissemination in random graph topologies (Q1957826) (← links)
- The role of randomness in the broadcast congested clique model (Q2051760) (← links)
- Breaking the \(\log n\) barrier on rumor spreading (Q2075628) (← links)
- Faster rumor spreading with multiple calls (Q2256120) (← links)
- Communication complexity of quasirandom rumor spreading (Q2354024) (← links)
- Asymptotically Optimal Randomized Rumor Spreading (Q3012944) (← links)
- Efficient Broadcasting in Random Power Law Networks (Q3057632) (← links)
- Randomized broadcast in networks (Q3197297) (← links)
- Introducing Quasirandomness to Computer Science (Q3644716) (← links)
- (Q4965812) (← links)
- An Asymptotically Optimal Push–Pull Method for Multicasting Over a Random Network (Q5346432) (← links)
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems (Q5892351) (← links)
