scientific article; zbMATH DE number 3881890

From MaRDI portal
Publication:3216149





[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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216149)