On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees
From MaRDI portal
Publication:1391306
DOI10.1016/S0304-3975(96)00269-1zbMath0901.68147MaRDI QIDQ1391306
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (2)
Reductions of binary trees and lattice paths induced by the register function ⋮ Fractal property of generalized M-set with rational number exponent
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The average number of registers needed to evaluate a binary tree optimally
- The number of registers required for evaluating arithmetic expressions
- Singularity Analysis of Generating Functions
- Register Allocation for Unary–Binary Trees
- On the Order of Random Channel Networks
- Horton-Strahler ordering of random binary trees
- Solution of a problem of yekutieli and mandelbrot
This page was built for publication: On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees
