The average number of registers needed to evaluate a binary tree optimally
type: Item
instance of: scholarly article
title: The average number of registers needed to evaluate a binary tree optimally
zbMATH Open document ID: 0395.68059
DOI: 10.1007/BF00289094
author: K. Appert
published in: Acta Informatica
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 26-04
Mathematics Subject Classification ID: 33-04
zbMATH DE Number: 3614191
zbMATH Keywords: Binary Tree
zbMATH Keywords: Registers
zbMATH Keywords: Asymptotic Expansion
zbMATH Keywords: Enumeration
MaRDI profile type: Publication
cites work: Q5621389
cites work: Q5659554
cites work: Q5786798
cites work: On compiling algorithms for arithmetic expressions
cites work: The Generation of Optimal Code for Arithmetic Expressions
full work available at URL: https://doi.org/10.1007/bf00289094
OpenAlex ID: W1998448131
description: scientific article; zbMATH DE number 3614191