Dynamic Programming For Instruction Selection

Dynamic Programming for Instruction Selection is a method in compiler design that employs dynamic programming techniques to optimally match intermediate code expressions to target machine instructions by recursively decomposing the problem into overlapping subproblems and leveraging optimal substructure for efficient code generation.

12

Publications

285

Citations

21

Authors

6

Institutions

Publications per year

2017–2026

0

Authors

21

  1. AB
    Andrzej Bednarski

    Linköping University, Sweden

    5 publications · 100 citations

    5

    h-index

  2. RL
    Rainer Leupers

    RWTH Aachen University, Germany

    2 publications · 56 citations

    2

    h-index

  3. CK
    Christoph Keßler

    Linköping University, Sweden

    2 publications · 22 citations

    2

    h-index

  4. DF
    Dag Fritzson

    Linköping University, Sweden

    1 publications · 18 citations

    1

    h-index

  5. RB
    Rajkishore Barik

    Intel (United States), United States

    1 publications · 51 citations

    1

    h-index

1–5 of 21

Venues

  1. International Conference on Computer Aided Design

    Conference · 1 publications · 12 citations

    1

    h-index

  2. 1

    h-index

  3. KTH Publication Database DiVA (KTH Royal Institute of Technology)

    Repository · 1 publications · 29 citations

    1

    h-index

  4. ACM SIGPLAN Notices

    1 publications · 12 citations

    1

    h-index

1–4