On the runtime and robustness of randomized broadcasting
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 1256692 (Why is no real title available?)
- scientific article; zbMATH DE number 219254 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A guided tour of Chernoff bounds
- Adaptive broadcasting with faulty nodes
- Agent-based randomized broadcasting in large networks
- Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Graph-Theoretic Concepts in Computer Science
- Handbook of Graph Theory
- On Spreading a Rumor
- Optimal Assignments of Numbers to Vertices
- Probability and Computing
- Randomized broadcast in networks
- The mathematics of infectious diseases
Cited in
(35)- Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 7525473 (Why is no real title available?)
- Broadcasting on paths and cycles
- On broadcasting time in the model of travelling agents
- Simplified Chernoff bounds with powers-of-two probabilities
- Limits for rumor spreading in stochastic populations
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Agent-based randomized broadcasting in large networks
- On the Runtime and Robustness of Randomized Broadcasting
- Randomised Broadcasting: Memory vs. Randomness
- Reliability versus cost: Design of a probabilistic broadcast algorithm
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
- Leveraging parameterized Chernoff bounds for simplified algorithm analyses
- Propagation time for probabilistic zero forcing
- Broadcast Extensions with Optimal Communication and Round Complexity
- On linear-time data dissemination in dynamic rooted trees
- Velocity dispersion in an elastic plate with microstructure: effects of characteristic length in a couple stress model
- Randomized rumour spreading: the effect of the network topology
- scientific article; zbMATH DE number 1875436 (Why is no real title available?)
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions
- On randomized broadcasting in star graphs
- Close-to-optimal and near-optimal broadcasting in random graphs
- An application of a size-dependent model on microplate with elastic medium based on strain gradient elasticity theory
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Round robin is optimal for fault-tolerant broadcasting on wireless networks
- Nonlinear vibration analysis of micro-plates based on strain gradient elasticity theory
- Randomized broadcast in networks
- On mixing and edge expansion properties in randomized broadcasting
- An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
- Broadcasting in random graphs
- scientific article; zbMATH DE number 7318978 (Why is no real title available?)
- On the Push&Pull Protocol for Rumor Spreading
- Robustness of randomized rumour spreading
- The worst case behavior of randomized gossip protocols
This page was built for publication: On the runtime and robustness of randomized broadcasting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q838155)
