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]

Authors

Philip Brisk

This author has not been identified. Look up 'Philip Brisk' in Google

Ajay K. Verma

This author has not been identified. Look up 'Ajay K. Verma' in Google

Paolo Ienne

This author has not been identified. Look up 'Paolo Ienne' in Google