Register Allocation for Unary–Binary Trees
From MaRDI portal
Publication:3753507
DOI10.1137/0215046zbMath0612.68065OpenAlexW2020658344MaRDI QIDQ3753507
Prodinger, Helmut, Philippe Flajolet
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0215046
Mellin transformgenerating functionsanalysis of algorithmssingularity analysisrandom treesregister allocationMellin inversionevaluation of arithmetic expressionsunary-binary trees
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Theory of software (68N99)
Related Items (15)
Brownian motion and algorithm complexity ⋮ The height of multiple edge plane trees ⋮ Random walks, Gaussian processes and list structures ⋮ Some width function asymptotics for weighted trees ⋮ On the Monoid Generated by a Lucas Sequence ⋮ 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 ⋮ Mellin transforms and asymptotics: Harmonic sums ⋮ The Horton-Strahler number of conditioned Galton-Watson trees ⋮ Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks ⋮ The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects ⋮ Combinatorial design of pseudoknot RNA ⋮ Efficient computation of the iteration of functions ⋮ Random self-similar trees: a mathematical theory of Horton laws
This page was built for publication: Register Allocation for Unary–Binary Trees
