| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428937 | Information Processing Letters | 2006 | 6 Pages |
Abstract
This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
