Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

39

IPL
2006

favoriteEmaildiscussreport

104views more IPL 2006»

Optimal register allocation for SSA-form programs in polynomial time

14 years 12 days ago

Optimal register allocation for SSA-form programs in polynomial time

Download www.cs.ucla.edu

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. 2006 Elsevier B.V. All rights reserved.

Sebastian Hack, Gerhard Goos

Real-time Traffic

Constructive Proof | IPL 2006 | Register Allocation Problem | Uniform Register |

claim paper

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	IPL
Authors	Sebastian Hack, Gerhard Goos

Comments (0)