Efficient Computation of Expressions with Common Subexpressions
- 1 January 1980
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 27 (1) , 146-163
- https://doi.org/10.1145/322169.322182
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence ConstraintsOperations Research, 1978
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence ConstraintsPublished by Elsevier ,1978
- How hard is compiler code generation?Lecture Notes in Computer Science, 1977
- Code Generation for Expressions with Common SubexpressionsJournal of the ACM, 1977
- Optimal Code Generation for Expression TreesJournal of the ACM, 1976
- Code Generation for a One-Register MachineJournal of the ACM, 1976
- The Generation of Optimal Code for Stack MachinesJournal of the ACM, 1975
- Register Assignment Algorithm for Generation of Highly Optimized Object CodeIBM Journal of Research and Development, 1974
- On compiling algorithms for arithmetic expressionsCommunications of the ACM, 1967
- On programming of arithmetic operationsCommunications of the ACM, 1958