Pages that link to "Item:Q838155"
From MaRDI portal
The following pages link to On the runtime and robustness of randomized broadcasting (Q838155):
Displaying 26 items.
- An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication (Q293191) (← links)
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions (Q378238) (← links)
- The worst case behavior of randomized gossip protocols (Q477180) (← links)
- Reliability versus cost: Design of a probabilistic broadcast algorithm (Q1331788) (← links)
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication (Q1689748) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- Round robin is optimal for fault-tolerant broadcasting on wireless networks (Q1878699) (← links)
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits (Q2002052) (← links)
- An application of a size-dependent model on microplate with elastic medium based on strain gradient elasticity theory (Q2014540) (← links)
- Nonlinear vibration analysis of micro-plates based on strain gradient elasticity theory (Q2436899) (← links)
- Velocity dispersion in an elastic plate with microstructure: effects of characteristic length in a couple stress model (Q2510308) (← links)
- Randomized broadcast in networks (Q3197297) (← links)
- Randomised Broadcasting: Memory vs. Randomness (Q3557029) (← links)
- (Q4796195) (← links)
- Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model (Q4808317) (← links)
- (Q4965812) (← links)
- Robustness of randomized rumour spreading (Q4993120) (← links)
- (Q4993318) (← links)
- (Q5075774) (← links)
- Propagation time for probabilistic zero forcing (Q5090539) (← links)
- On the Push&Pull Protocol for Rumor Spreading (Q5346546) (← links)
- Broadcast Extensions with Optimal Communication and Round Complexity (Q5361959) (← links)
- Randomized Rumour Spreading: The Effect of the Network Topology (Q5364236) (← links)
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems (Q5891998) (← links)
- Simplified Chernoff bounds with powers-of-two probabilities (Q6161458) (← links)
- Leveraging parameterized Chernoff bounds for simplified algorithm analyses (Q6602327) (← links)
