No label defined (Q3676157)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3896954
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3896954 |
Statements
1985
0 references
Mellin transform techniques
0 references
register function
0 references
Analysis of Algorithms
0 references
0.7708727121353149
0 references
0.764181911945343
0 references
[For the entire collection see Zbl 0547.00013.] In this paper the expected value of all those nodes of a binary tree is investigated that cause the register function of the tree (if evaluated recursively) to grow by 1. The author uses an interesting analytic technique to gain the asymptotic result, namely the idea to find the local behaviour of the involved generating functions about its singularities by making use of the Mellin transform. Thus the paper follows in best tradition the French school of Analysis of Algorithms around Ph. Flajolet, which during the last years has been able to find a lot of interesting and deep results in the area by a combination of methods of Discrete Mathematics and Mathematical Analysis (compare the references).
0 references