scientific article
From MaRDI portal
Publication:3339285
zbMath0547.68041MaRDI QIDQ3339285
Publication date: 1984
Full work available at URL: https://eudml.org/doc/92216
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
recurrence relationbinary treesleft heightnumber of registers required for evaluating an arithmetic expression
Symbolic computation and algebraic computation (68W30) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Recurrences (11B37) Continued fractions (11A55)
Related Items (7)
Brownian motion and algorithm complexity ⋮ A note on the Horton-Strahler number for random trees ⋮ A one-to-one correspondence between two classes of ordered trees ⋮ Interview with Xavier Viennot ⋮ Animaux et arbres guingois. (Animals and guingois trees) ⋮ On the Horton-Strahler number for random tries ⋮ Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial aspects of continued fractions
- The average number of registers needed to evaluate a binary tree optimally
- The number of registers required for evaluating arithmetic expressions
- Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi
- On programming of arithmetic operations
- The Generation of Optimal Code for Arithmetic Expressions
This page was built for publication:
