Register Allocation for Unary–Binary Trees

DOI10.1137/0215046zbMATH Open0612.68065OpenAlexW2020658344MaRDI QIDQ3753507FDOQ3753507

Authors: Helmut Prodinger, 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

Recommendations

• scientific article; zbMATH DE number 4027493
• The register function for \(t\)-ary trees
• The complexity of register allocation
• Register Allocation in Structured Programs
• Publication:4886067
• More general parallel tree contraction: Register allocation and broadcasting in a tree
• A compact encoding of unordered binary trees
• Generalizations of the sethi‐ullman algorithm for register allocation
• Register allocation: A program-algebraic approach

zbMATH Keywords

Mellin transformanalysis of algorithmsgenerating functionsrandom treessingularity analysisregister allocationMellin inversionevaluation of arithmetic expressionsunary-binary trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Theory of software (68N99)

Cited In (17)

• Brownian motion and algorithm complexity
• Mellin transforms and asymptotics: Harmonic sums
• Solution of a problem of Yekutieli and Mandelbrot
• The height of multiple edge plane trees
• The Horton-Strahler number of conditioned Galton-Watson trees
• Efficient computation of the iteration of functions
• Random self-similar trees: a mathematical theory of Horton laws
• 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
• On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees
• Title not available (Why is that?)
• Combinatorial design of pseudoknot RNA
• 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
• Title not available (Why is that?)
• Random walks, Gaussian processes and list structures

This page was built for publication: Register Allocation for Unary–Binary Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753507)