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

DOI10.1016/S0020-0190(97)00225-1zbMath1338.68306OpenAlexW2046170293MaRDI QIDQ293191

Peter J. Grabner, Prodinger, Helmut

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

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)

Related Items (1)

Sorting algorithms for broadcast communications: mathematical analysis.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication