Optimal Code Generation for Expression Trees

DOI10.1145/321958.321970zbMATH Open0334.68022OpenAlexW2070053315MaRDI QIDQ4101424FDOQ4101424

Authors:

Publication date: 1976

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321958.321970

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cited In (7)

• APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
• Optimal contiguous expression DAG evaluations
• Richard Bellman's contributions to computer science
• Code selection by inversion of order-sorted derivors
• Integrating code generation and peephole optimization
• The string merging problem
• A generalization of Dijkstra's algorithm

This page was built for publication: Optimal Code Generation for Expression Trees

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