Pages that link to "Item:Q2875167"
From MaRDI portal
The following pages link to Almost tight bounds for rumour spreading with conductance (Q2875167):
Displaying 22 items.
- The worst case behavior of randomized gossip protocols (Q477180) (← links)
- Rumor spreading in social networks (Q541666) (← links)
- Simple multi-party set reconciliation (Q2075624) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Faster rumor spreading with multiple calls (Q2256120) (← links)
- Rumor spreading with bounded in-degree (Q2292916) (← links)
- Communication complexity of quasirandom rumor spreading (Q2354024) (← links)
- Asynchronous rumor spreading on random graphs (Q2408097) (← links)
- Discovery through gossip (Q2811164) (← links)
- Social networks spread rumors in sublogarithmic time (Q2857363) (← links)
- Push is Fast on Sparse Random Graphs (Q2953404) (← links)
- Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
- Asymptotically Optimal Randomized Rumor Spreading (Q3012944) (← links)
- Tight bounds for rumor spreading in graphs of a given conductance (Q3113672) (← links)
- Theory and Practice of Discrete Interacting Agents Models (Q4686660) (← links)
- Randomized Rumour Spreading: The Effect of the Network Topology (Q5364236) (← links)
- Brief Announcement (Q5368972) (← links)
- Global computation in a poorly connected world (Q5415528) (← links)
- Random Walks, Electric Networks and The Transience Class problem of Sandpiles (Q5743503) (← links)
- (Q5743505) (← links)
- Ultra-fast rumor spreading in social networks (Q5743506) (← links)
- Asymptotics for push on the complete graph (Q5918276) (← links)
