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
Parents
12
1–5 of 12
21
5
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 21
6

Linköping University
Linköping, Sweden
3 h-index
4 publications
73 citations
TU Dortmund University
Dortmund, Germany
2 h-index
4 publications
112 citations
Neusoft (China)
Shenyang, China
1 h-index
1 publications
16 citations

Rice University
Houston, United States
1 h-index
2 publications
102 citations
Intel (United States)
Santa Clara, United States
1 h-index
1 publications
51 citations
Wuhan University
Wuhan, China
1 h-index
2 publications
32 citations
1–6 of 6
Conference · 1 publications · 12 citations
1
h-index
1 publications · 22 citations
1
h-index
Repository · 1 publications · 29 citations
1
h-index
1 publications · 12 citations
1
h-index
1–4