An optimistic and conservative register assignment heuristic for chordal graphs

Philip Brisk, Ajay K. Verma, Paolo Ienne. An optimistic and conservative register assignment heuristic for chordal graphs. In Taewhan Kim, Pascal Sainrat, Steven S. Lumetta, Nacho Navarro, editors, Proceedings of the 2007 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2007, Salzburg, Austria, September 30 - October 3, 2007. pages 209-217, ACM, 2007. [doi]

@inproceedings{BriskVI07:0,
  title = {An optimistic and conservative register assignment heuristic for chordal graphs},
  author = {Philip Brisk and Ajay K. Verma and Paolo Ienne},
  year = {2007},
  doi = {10.1145/1289881.1289919},
  url = {http://doi.acm.org/10.1145/1289881.1289919},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BriskVI07%3A0},
  cites = {0},
  citedby = {0},
  pages = {209-217},
  booktitle = {Proceedings of the 2007 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2007, Salzburg, Austria, September 30 - October 3, 2007},
  editor = {Taewhan Kim and Pascal Sainrat and Steven S. Lumetta and Nacho Navarro},
  publisher = {ACM},
}