On the runtime and robustness of randomized broadcasting
From MaRDI portal
Publication:838155
DOI10.1016/J.TCS.2008.04.017zbMATH Open1206.68362OpenAlexW1970542229MaRDI QIDQ838155FDOQ838155
Authors: Robert Elsässer, Thomas Sauerwald 
Publication date: 21 August 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.017
Recommendations
Cites Work
- The mathematics of infectious diseases
- Title not available (Why is that?)
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Optimal Assignments of Numbers to Vertices
- Handbook of Graph Theory
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Probability and Computing
- On Spreading a Rumor
- Adaptive broadcasting with faulty nodes
- A guided tour of Chernoff bounds
- Title not available (Why is that?)
- Randomized broadcast in networks
- Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
- Agent-based randomized broadcasting in large networks
Cited In (35)
- Propagation time for probabilistic zero forcing
- On linear-time data dissemination in dynamic rooted trees
- Nonlinear vibration analysis of micro-plates based on strain gradient elasticity theory
- Velocity dispersion in an elastic plate with microstructure: effects of characteristic length in a couple stress model
- 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
- Agent-based randomized broadcasting in large networks
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model
- Title not available (Why is that?)
- Randomized rumour spreading: the effect of the network topology
- An application of a size-dependent model on microplate with elastic medium based on strain gradient elasticity theory
- An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
- On the Runtime and Robustness of Randomized Broadcasting
- Leveraging parameterized Chernoff bounds for simplified algorithm analyses
- Broadcasting on paths and cycles
- Randomized broadcast in networks
- On broadcasting time in the model of travelling agents
- Graph-Theoretic Concepts in Computer Science
- Broadcast Extensions with Optimal Communication and Round Complexity
- Title not available (Why is that?)
- The worst case behavior of randomized gossip protocols
- Simplified Chernoff bounds with powers-of-two probabilities
- Reliability versus cost: Design of a probabilistic broadcast algorithm
- Broadcasting in random graphs
- Randomised Broadcasting: Memory vs. Randomness
- On randomized broadcasting in star graphs
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
- Robustness of randomized rumour spreading
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions
- Title not available (Why is that?)
- Limits for rumor spreading in stochastic populations
- Close-to-optimal and near-optimal broadcasting in random graphs
- On mixing and edge expansion properties in randomized broadcasting
- On the Push&Pull Protocol for Rumor Spreading
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)
