@inproceedings{conf/lcpc/BouchezDGR06,
	title = {Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How.},
	author = {Florent Bouchez and Alain Darte and Christophe Guillon and Fabrice Rastello},
	booktitle = {LCPC},
	crossref = {conf/lcpc/2006},
	editor = {George Almási and Calin Cascaval and Peng Wu},
	pages = {283-298},
	publisher = {Springer},
	series = {Lecture Notes in Computer Science},
	url = {http://dblp.uni-trier.de/db/conf/lcpc/lcpc2006.html#BouchezDGR06},
	volume = {4382},
	year = {2006},
	biburl = {http://www.bibsonomy.org/bibtex/2ef6e61678e5cd07402f376d6ebc305ff/dblp},
	description = {dblp},
	ee = {http://dx.doi.org/10.1007/978-3-540-72521-3_21}, isbn = {978-3-540-72520-6}, date = {2007-09-13},
	keywords = {dblp }
}