Pages that link to "Item:Q2075628"
From MaRDI portal
The following pages link to Breaking the \(\log n\) barrier on rumor spreading (Q2075628):
Displaying 8 items.
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- Spreading alerts quietly and the subgroup escape problem (Q901371) (← links)
- Social networks spread rumors in sublogarithmic time (Q2857363) (← links)
- Almost tight bounds for rumour spreading with conductance (Q2875167) (← links)
- Faster Rumor Spreading: Breaking the logn Barrier (Q2920965) (← links)
- On the Push&Pull Protocol for Rumor Spreading (Q5346546) (← links)
- Global computation in a poorly connected world (Q5415528) (← links)
- Spreading Alerts Quietly and the Subgroup Escape Problem (Q5451074) (← links)