๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On an asymptotic analysis of a tree-type algorithm for broadcast communications

โœ Scribed by Wojciech Szpankowski

Book ID
113162938
Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
378 KB
Volume
23
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An asymptotic study of a recursion occur
An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
โœ Peter J. Grabner; Helmut Prodinger ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 310 KB

Shiau and Yang (1996) proved that a certain quantity Tn occurring in the analysis of an algorithm on broadcast communication satisfies 4 << T,/(logn) << 5. We give an explicit expression for Tn involving Bernoulli numbers and a precise asymptotic formula showing in particular that Tn/( log n) + 7