Optimal Code Generation
Optimal Code Generation is a code generation method that belongs to the class of instruction selection techniques in compiler design, distinguished by its goal of producing target code that is provably minimal or least-cost with respect to a given cost metric, such as execution time, code size, or resource usage.
103
Publications
5.1K
Citations
206
Authors
98
Institutions
Publications per year
2017–2026
11
Parents
103
The Generation of Optimal Code for Arithmetic Expressions
Ravi Sethi, Jeffrey D. Ullman · Journal of the ACM · 1970 · 295 citations · Full text
Optimal Code Generation for Expression Trees
Alfred V. Aho, S. C. Johnson · Journal of the ACM · 1976 · 242 citations · Full text
1–5 of 103
206
5
h-index
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 206
98
Princeton University
Princeton, United States
7 h-index
11 publications
868 citations
University of Southern California
Los Angeles, United States
4 h-index
6 publications
243 citations

Linköping University
Linköping, Sweden
4 h-index
5 publications
92 citations

Rice University
Houston, United States
3 h-index
7 publications
903 citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
3 h-index
7 publications
122 citations
Stanford University
Stanford, United States
3 h-index
7 publications
295 citations
University of Virginia
Charlottesville, United States
2 h-index
2 publications
41 citations
Colorado State University
Fort Collins, United States
2 h-index
7 publications
138 citations
1–8 of 98
7 publications · 172 citations
7
h-index
6 publications · 355 citations
6
h-index
6 publications · 389 citations
6
h-index
JACM · 4 publications · 585 citations
4
h-index
Repository · 2 publications · 52 citations
2
h-index
1–5