1. Improvements to graph coloring register allocation;Briggs;ACM Transactions on Programming Languages and Systems,1994
2. A.L. Buchsbaum, H. Karloff, C. Kenyon, N. Reingold, M. Thorup, OPT versus LOAD in dynamic storage allocation, in: Proceedioings of the 35th Annual ACM Symposium on Therory of Computing, STOC, 2003, pp. 556–564.
3. Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Restricted strip covering and the sensor cover problem, the full version is at http://arxiv.org/PS_cache/cs/pdf/0605/0605102v1.pdf. The conference version appears in: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, SODA, 2007, pp. 1056–1063.
4. Register allocation & spilling via graph coloring;Chaitin,1982
5. The priority-based coloring approach to register allocation;Chow;ACM Transactions on Programming Languages and Systems,1990