Superoptimization
Superoptimization is an instruction selection technique in compiler optimization that belongs to the class of exhaustive search methods and is distinguished by its use of brute-force enumeration to find the globally optimal sequence of target-machine instructions for a given code fragment.
34
Publications
2.1K
Citations
68
Authors
23
Institutions
Publications per year
2017–2026
9
Parents
34
Eric Schkufza, Rahul Sharma, Alex Aiken · 2013 · 277 citations
Superoptimizer: a look at the smallest program
Henry Massalin · ACM SIGPLAN Notices · 1987 · 229 citations
Automatic generation of peephole superoptimizers
Sorav Bansal, Alex Aiken · 2006 · 166 citations
Rajeev Joshi, Greg Nelson, Keith H. Randall · 2002 · 154 citations
Superoptimizer: a look at the smallest program
Henry Massalin · 1987 · 152 citations · Full text
1–5 of 34
68
10
h-index
6
h-index
5
h-index
4
h-index
4
h-index
1–5 of 68
23
Stanford University
Stanford, United States
10 h-index
28 publications
1.8K citations
Columbia University
New York, United States
4 h-index
4 publications
459 citations
University of Washington
Seattle, United States
3 h-index
5 publications
381 citations
Qualcomm (United States)
San Diego, United States
2 h-index
2 publications
93 citations
Google (United States)
Mountain View, United States
2 h-index
2 publications
93 citations
University of California, Berkeley
Berkeley, United States
2 h-index
2 publications
93 citations
Universidad Complutense de Madrid
Madrid, Spain
1 h-index
4 publications
76 citations

Shanghai Jiao Tong University
Shanghai, China
1 h-index
7 publications
203 citations
1–8 of 23
5 publications · 308 citations
5
h-index
Repository · 3 publications · 91 citations
3
h-index
3 publications · 121 citations
3
h-index
1 publications · 38 citations
1
h-index
1 publications · 21 citations
1
h-index
1–5