An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
β Scribed by Peter J. Grabner; Helmut Prodinger
- Book ID
- 104137556
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 310 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
β¦ Synopsis
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?/(31og2) = 4.74627644.. . .
π SIMILAR VOLUMES
A case of a carcinoid tumor of the kidney that was intimately related to a mixed dysplastic and teratomatous lesion is reported. This lesion displayed focal transitional, mucinous, and endocrine differentiations. Immunofluorescence studies permit the identification of three immunoreactive products: