The number of registers required for evaluating arithmetic expressions

DOI10.1016/0304-3975(79)90009-4zbMath0407.68057OpenAlexW1981714789WikidataQ55934661 ScholiaQ55934661MaRDI QIDQ1258177

Philippe Flajolet, Jean Claude Raoult, Jean E. Vuillemin

Publication date: 1979

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(79)90009-4

zbMATH Keywords

Analysis of AlgorithmsCombinatorial AnalysisEvaluation of Arithmetic ExpressionsRegister AllocationSampled Sums of Binomial CoefficientsStrahler NumberTchebycheff Polynomials

Mathematics Subject Classification ID

Theory of computing (68Q99)

Related Items

A note on the Horton-Strahler number for random trees, The joint distribution of the three types of nodes in uniform binary trees, Fractal digital sums and codes, On some applications of formulae of Ramanujan in the analysis of algorithms, 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, Fringe analysis of plane trees related to cutting and pruning, 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, Interview with Xavier Viennot, Convergence of Newton's method over commutative semirings, Dynamical pruning of rooted trees with applications to 1-D ballistic annihilation, Automata for the verification of monadic second-order graph properties, The average height of binary trees and other simple trees, Mellin transforms and asymptotics: Harmonic sums, Random trees in queueing systems with deadlines, Tree compression using string grammars, Unnamed Item, The Horton-Strahler number of conditioned Galton-Watson trees, FCFS-scheduling in a hard real-time environment under rush-hour conditions, Some investigations on FCFS scheduling in hard real time applications, Connected graph searching, DNA-templated synthesis optimization, On the recursion depth of special tree traversal algorithms, Reversible pebble games and the relation between tree-like and general resolution space, Efficient computation of the iteration of functions, Random self-similar trees: a mathematical theory of Horton laws, Arithmetic and \(k\)-maximality of the cyclic free magma, The properties of random trees, On the Horton-Strahler number for random tries, Mellin transforms and asymptotics: Digital sums, Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur la fonction sommatoire de la fonction 'somme des chiffres'
• The average number of registers needed to evaluate a binary tree optimally
• On programming of arithmetic operations
• A Note on Gray Code and Odd-Even Merge
• On compiling algorithms for arithmetic expressions
• The Generation of Optimal Code for Arithmetic Expressions