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

Authors

68

  1. AA
    Alex Aiken

    Stanford University, United States

    10 publications · 695 citations

    10

    h-index

  2. RS
    Rahul Sharma

    Stanford University, United States

    6 publications · 415 citations

    6

    h-index

  3. ES
    Eric Schkufza

    Stanford University, United States

    5 publications · 395 citations

    5

    h-index

  4. HM
    Henry Massalin

    Columbia University, United States

    4 publications · 459 citations

    4

    h-index

  5. SB
    Sorav Bansal

    Stanford University, United States

    4 publications · 280 citations

    4

    h-index

1–5 of 68

Venues

  1. ACM SIGPLAN Notices

    5 publications · 308 citations

    5

    h-index

  2. arXiv (Cornell University)

    Repository · 3 publications · 91 citations

    3

    h-index

  3. ACM SIGARCH Computer Architecture News

    3 publications · 121 citations

    3

    h-index

  4. 1

    h-index

  5. 1

    h-index

1–5