scientific article

zbMATH Open0523.68054MaRDI QIDQ3674071FDOQ3674071

Author name not available (Why is that?)

Publication date: 1983

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

Title of this publication is not available (Why is that?)

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The average height of binary trees and other simple trees
• The average height of r-tuply rooted planted plane 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
• The Generation of Optimal Code for Arithmetic Expressions
• On compiling algorithms for arithmetic expressions

Cited In (2)

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

This page was built for publication:

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