The register function for t-ary trees

Authors:
Michael Drmota;Helmut Prodinger
Affiliations:
Vienna University of Technology, Vienna, Austria;University of Stellenbosch
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2006

Citing 8
Cited 1

Register allocation for unary binary trees

SIAM Journal on Computing
On the recursion depth of special tree traversal algorithms

Information and Computation
A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number

Discrete Mathematics
On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees

Theoretical Computer Science - Special issue: Latin American theoretical informatics
A note on the Horton-Strahler number for random binary search trees

Information Processing Letters
On programming of arithmetic operations

Communications of the ACM
Trees Everywhere

CAAP '90 Proceedings of the 15th Colloquium on Trees in Algebra and Programming
A unified approach to the analysis of Horton-Strahler parameters of binary tree structures

Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"

Note: Efficient computation of the iteration of functions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the register function for t-ary trees, recently introduced by Auber et al., we prove that the average is log4n + O(1), if all such trees with n internal nodes are considered to be equally likely.This result remains true for rooted trees where the set of possible out-degrees is finite. Furthermore we obtain exponential tail estimates for the distribution of the register function. Thus, the distribution is highly concentrated around the mean value.