Randomized broadcast in networks
From MaRDI portal
Recommendations
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- On the Runtime and Robustness of Randomized Broadcasting
- On the runtime and robustness of randomized broadcasting
- Broadcasting in random graphs
- Broadcasting in random graphs
- On Randomized Broadcasting in Power Law Networks
Cited in
(72)- On randomized broadcasting in star graphs
- On broadcasting in unicyclic graphs
- On optimal broadcasting in faulty hypercubes
- Deterministic broadcasting time with partial knowledge of the network.
- On linear-time data dissemination in dynamic rooted trees
- The role of randomness in the broadcast congested clique model
- Breaking the \(\log n\) barrier on rumor spreading
- Stochastic analysis of rumor spreading with multiple pull operations
- Faster rumor spreading with multiple calls
- Communication complexity of quasirandom rumor spreading
- Direction-reversing quasi-random rumor spreading with restarts
- Analysis of randomized protocols for conflict-free distributed access
- Radio communication in random graphs
- Broadcast in the rendezvous model
- Asymptotics for pull on the complete graph
- Efficient communication in unknown networks
- Rumor spreading in random evolving graphs
- Pseudorandomness for network algorithms
- Randomized rumor spreading in poorly connected small-world networks
- Asynchronous broadcasting with bivalent beeps
- Sparsifying congested cliques and core-periphery networks
- Quasirandom rumor spreading on expanders
- Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting
- Rumor spreading on random regular graphs and expanders
- Asymptotically optimal randomized rumor spreading
- Information Spreading in a Large Population of Active Transmitters and Passive Receivers
- Push is Fast on Sparse Random Graphs
- Rumor spreading with no dependence on conductance
- Asymptotically optimal randomized rumor spreading
- Efficient broadcasting in random power law networks
- Time-efficient broadcast in radio networks
- Sub-linear universal spatial gossip protocols
- Randomised Broadcasting: Memory vs. Randomness
- Introducing Quasirandomness to Computer Science
- Randomized parallel communications on an extension of the omega network
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions
- Randomised broadcasting: memory vs. randomness
- Rumors spread slowly in a small-world spatial network
- Asymptotic bounds on the equilateral dimension of hypercubes
- The string of diamonds is nearly tight for rumour spreading
- Robustness of randomized rumour spreading
- The String of Diamonds Is Tight for Rumor Spreading
- scientific article; zbMATH DE number 7525473 (Why is no real title available?)
- Time-message trade-offs in distributed algorithms
- Stateless Information Dissemination Algorithms
- Broadcasting on cactus graphs
- Probabilistic Analysis of Rumor-Spreading Time
- Broadcasting on Random Directed Acyclic Graphs
- The Weighted Coupon Collector’s Problem and Applications
- An Asymptotically Optimal Push–Pull Method for Multicasting Over a Random Network
- On the Push&Pull Protocol for Rumor Spreading
- Randomized rumour spreading: the effect of the network topology
- On Mixing and Edge Expansion Properties in Randomized Broadcasting
- Rumor spreading in social networks
- Rumor spreading and vertex expansion
- Order optimal information spreading using algebraic gossip
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Asymptotics for push on the complete graph
- Broadcasting in weighted trees under the postal model
- Continuous-time stochastic analysis of rumor spreading with multiple operations
- Messy broadcasting - decentralized broadcast schemes with limited knowledge
- An analytical model for multi-epidemic information dissemination
- Spread of information and diseases via random walks in sparse graphs
- Finding broadcast 2-centers of a tree under the postal model
- Parsimonious flooding in dynamic graphs
- Asymptotically optimal message dissemination with applications to blockchains
- Time- and communication-efficient overlay network construction via gossip
- On the runtime and robustness of randomized broadcasting
- On the number of broadcast schemes in networks
- On mixing and edge expansion properties in randomized broadcasting
- Agent-based randomized broadcasting in large networks
This page was built for publication: Randomized broadcast in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3197297)
