An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
From MaRDI portal
(Redirected from Publication:293191)
Recommendations
- Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model
- Analysis of a Recurrence Arising from a Construction for Nonblocking Networks
- Optimal and near-optimal broadcast in random graphs
- scientific article; zbMATH DE number 975322
- On the Runtime and Robustness of Randomized Broadcasting
- On the runtime and robustness of randomized broadcasting
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- A general broadcasting scheme for recursive networks with complete connection
- Broadcasting on random recursive trees
- Asymptotic analysis of multistage cooperative broadcast in wireless networks
Cites work
- scientific article; zbMATH DE number 473229 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A fast maximum finding algorithm on broadcast communication
- How to select a loser
- Mellin transforms and asymptotics: Digital sums
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- The evaluation of an alternative sum with applications to the analysis of some data structures
Cited in
(3)
This page was built for publication: An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293191)