The average number of registers needed to evaluate a binary tree optimally

DOI10.1007/BF00289094zbMath0395.68059OpenAlexW1998448131MaRDI QIDQ1253100

K. Appert

Publication date: 1979

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289094

zbMATH Keywords

EnumerationAsymptotic ExpansionBinary TreeRegisters

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to real functions (26-04) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to special functions (33-04)

Related Items (26)

The scientific works of Rainer Kemp (1949--2004) ⋮ A note on the Horton-Strahler number for random trees ⋮ The joint distribution of the three types of nodes in uniform binary trees ⋮ A one-to-one correspondence between two classes of ordered trees ⋮ On the average number of registers needed to evaluate a special class of backtrack trees ⋮ Unnamed Item ⋮ Reductions of binary trees and lattice paths induced by the register function ⋮ Solution of a problem of yekutieli and mandelbrot ⋮ On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees ⋮ The average height of r-tuply rooted planted plane trees ⋮ Philippe Flajolet's early work in combinatorics ⋮ Convergence of Newton's method over commutative semirings ⋮ On the average depth of a prefix of the Dycklanguage \(D_ 1\). ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ The average height of binary trees and other simple trees ⋮ Mellin transforms and asymptotics: Harmonic sums ⋮ Unnamed Item ⋮ The Horton-Strahler number of conditioned Galton-Watson trees ⋮ On the recursion depth of special tree traversal algorithms ⋮ Entropy rates for Horton self-similar trees ⋮ The average number of registers needed to evaluate a binary tree optimally ⋮ Efficient computation of the iteration of functions ⋮ The number of registers required for evaluating arithmetic expressions ⋮ Random self-similar trees: a mathematical theory of Horton laws ⋮ On the Horton-Strahler number for random tries ⋮ Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)

Cites Work

• The average number of registers needed to evaluate a binary tree optimally
• On compiling algorithms for arithmetic expressions
• The Generation of Optimal Code for Arithmetic Expressions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The average number of registers needed to evaluate a binary tree optimally