ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...