An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication

DOI10.1016/S0020-0190(97)00225-1zbMATH Open1338.68306OpenAlexW2046170293MaRDI QIDQ293191FDOQ293191

Authors: Peter J. Grabner, Helmut Prodinger 

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097002251?np=y

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

zbMATH Keywords

recursionBernoulli numbersRice's methodbroadcast communicationMellin-Perron formula

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mellin transforms and asymptotics: Finite differences and Rice's integrals
• How to select a loser
• The evaluation of an alternative sum with applications to the analysis of some data structures
• Mellin transforms and asymptotics: Digital sums
• A fast maximum finding algorithm on broadcast communication
• Title not available (Why is that?)

Cited In (3)

• Sorting algorithms for broadcast communications: mathematical analysis.
• Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model
• On the monotonicity of the broadcast function

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)