scientific article

zbMath0523.68054MaRDI QIDQ3674071

No author found.

Publication date: 1983

Full work available at URL: https://eudml.org/doc/92188

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

space complexityalgorithms for the reduction of binary trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99)

Related Items (2)

The scientific works of Rainer Kemp (1949--2004) ⋮ A one-to-one correspondence between two classes of ordered trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The average height of r-tuply rooted planted plane trees
• The average height of binary trees and other simple trees
• The average number of registers needed to evaluate a binary tree optimally
• The number of registers required for evaluating arithmetic expressions
• A note on the stack size of regularly distributed binary trees
• On compiling algorithms for arithmetic expressions
• The Generation of Optimal Code for Arithmetic Expressions

This page was built for publication: