Linear-time register allocation for a fixed number of registers and no stack variables, Proceedings 9th ACM-SIAM Symposium on Discrete Algorithms (SODA'98), pp.574-583 ,
URL : https://hal.archives-ouvertes.fr/inria-00549654
Letters to the editor: go to statement considered harmful, Communications of the ACM, vol.11, issue.3, pp.147-148, 1968. ,
DOI : 10.1145/362929.362947
Register Allocation in Structured Programs, Proceedings 6th ACM-SIAM Symposium on Discrete Algorithms (SODA'95), pp.360-368 ,
DOI : 10.1006/jagm.1998.0956
Graph Algorithms -Classes of graphs, Handbook of Theoretical Computer Science, pp.545-551, 1990. ,
Algorithms for detecting series-parallel graphs and D-charts, Trans. Inst. Elect. Commun. Japan, vol.59, issue.3a976, pp.259-260 ,
Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986. ,
DOI : 10.1016/0196-6774(86)90023-4
All Structured Programs have Small Tree-Width and Good Register Allocation, Information and Computation, 1998. ,
Campus scientifique, 615 rue du Jardin Botanique Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, p.78153, 2004. ,