Optimal Code Generation for Expression Trees
From MaRDI portal
Publication:4101424
DOI10.1145/321958.321970zbMath0334.68022OpenAlexW2070053315MaRDI QIDQ4101424
No author found.
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
Related Items (7)
Richard Bellman's contributions to computer science ⋮ Optimal contiguous expression DAG evaluations ⋮ The string merging problem ⋮ Code selection by inversion of order-sorted derivors ⋮ A generalization of Dijkstra's algorithm ⋮ Integrating code generation and peephole optimization ⋮ APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
This page was built for publication: Optimal Code Generation for Expression Trees