Christian Andersson. Register Allocation by Optimal Graph Coloring. In Görel Hedin, editor, Compiler Construction, 12th International Conference, CC 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings. Volume 2622 of Lecture Notes in Computer Science, pages 33-45, Springer, 2003. [doi]
@inproceedings{Andersson03,
title = {Register Allocation by Optimal Graph Coloring},
author = {Christian Andersson},
year = {2003},
url = {http://link.springer.de/link/service/series/0558/bibs/2622/26220033.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Andersson03},
cites = {0},
citedby = {0},
pages = {33-45},
booktitle = {Compiler Construction, 12th International Conference, CC 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings},
editor = {Görel Hedin},
volume = {2622},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-00904-3},
}