No label defined (Q3216149)
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 3881890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3881890 |
Statements
1984
0 references
analysis of algorithms
0 references
asymptotic enumeration
0 references
transversal algorithms
0 references
planted plane trees
0 references
0.902094542980194
0 references
0.7604852318763733
0 references
[For the entire collection see Zbl 0543.00014.] The aim of this paper is an asymptotic analysis of the recursion depth, i.e. the height of an auxiliary stack, when performing special transversal algorithms of planted plane trees. The proofs make use of combinatorial bijections as well as generating functions and the fact that the location and the nature of the singularities of the latter can be translated to information on the asymptotic behaviour of their Taylor coefficients.
0 references