The following pages link to Randomized broadcast in networks (Q3197297):
Displaying 50 items.
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions (Q378238) (← links)
- Randomised broadcasting: memory vs. randomness (Q391757) (← links)
- Asymptotic bounds on the equilateral dimension of hypercubes (Q497358) (← links)
- Broadcasting on cactus graphs (Q512890) (← links)
- Rumor spreading in social networks (Q541666) (← links)
- Messy broadcasting - decentralized broadcast schemes with limited knowledge (Q628314) (← links)
- An analytical model for multi-epidemic information dissemination (Q635303) (← links)
- Parsimonious flooding in dynamic graphs (Q661047) (← links)
- On the runtime and robustness of randomized broadcasting (Q838155) (← links)
- On the number of broadcast schemes in networks (Q845865) (← links)
- On mixing and edge expansion properties in randomized broadcasting (Q848940) (← links)
- Agent-based randomized broadcasting in large networks (Q867856) (← links)
- On randomized broadcasting in star graphs (Q1003763) (← links)
- On broadcasting in unicyclic graphs (Q1029711) (← links)
- On optimal broadcasting in faulty hypercubes (Q1339875) (← links)
- Deterministic broadcasting time with partial knowledge of the network. (Q1401209) (← links)
- On fast and robust information spreading in the vertex-congest model (Q1625611) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- The role of randomness in the broadcast congested clique model (Q2051760) (← links)
- Breaking the \(\log n\) barrier on rumor spreading (Q2075628) (← links)
- Stochastic analysis of rumor spreading with multiple pull operations (Q2157429) (← 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)
- Direction-reversing quasi-random rumor spreading with restarts (Q2445336) (← links)
- Analysis of randomized protocols for conflict-free distributed access (Q2461541) (← links)
- Radio communication in random graphs (Q2495397) (← links)
- Broadcast in the rendezvous model (Q2495650) (← links)
- Asymptotics for pull on the complete graph (Q2698490) (← links)
- Efficient communication in unknown networks (Q2747804) (← links)
- Rumor spreading in random evolving graphs (Q2795745) (← links)
- Pseudorandomness for network algorithms (Q2817628) (← links)
- Randomized rumor spreading in poorly connected small-world networks (Q2818280) (← links)
- Asynchronous Broadcasting with Bivalent Beeps (Q2835032) (← links)
- Sparsifying Congested Cliques and Core-Periphery Networks (Q2835033) (← links)
- Quasirandom rumor spreading on expanders (Q2851470) (← links)
- Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting (Q2851516) (← links)
- Rumor spreading on random regular graphs and expanders (Q2852547) (← links)
- Asymptotically optimal randomized rumor spreading (Q2857362) (← links)
- Information Spreading in a Large Population of Active Transmitters and Passive Receivers (Q2945471) (← 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)
- Efficient Broadcasting in Random Power Law Networks (Q3057632) (← links)
- Time-Efficient Broadcast in Radio Networks (Q3404475) (← links)
- Sub-linear Universal Spatial Gossip Protocols (Q3408159) (← links)
- Randomised Broadcasting: Memory vs. Randomness (Q3557029) (← links)
- Introducing Quasirandomness to Computer Science (Q3644716) (← links)
- Randomized parallel communications on an extension of the omega network (Q3766827) (← links)
- Rumors Spread Slowly in a Small-World Spatial Network (Q4588846) (← links)
