Jump to content

Chaitin's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by CesarB (talk | contribs) at 02:16, 31 May 2005 ({{compu-sci-stub}}). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Chaitin's algorithm is a graph coloring algorithm designed specifically for register allocation. It is named after its desiger, Gregory Chaitin.