메뉴 건너뛰기




Volumn 98, Issue 4, 2006, Pages 150-155

Optimal register allocation for SSA-form programs in polynomial time

Author keywords

Combinatorial problems; Graph algorithms

Indexed keywords

MATHEMATICAL PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; RESOURCE ALLOCATION; SET THEORY;

EID: 33644911751     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.01.008     Document Type: Article
Times cited : (38)

References (10)
  • 1
    • 33644919201 scopus 로고    scopus 로고
    • Register allocation by optimal graph coloring
    • G. Hedin, CC 2003, Springer-Verlag Heidelberg
    • C. Andersson Register allocation by optimal graph coloring G. Hedin CC 2003 Lecture Notes in Comput. Sci. vol. 2622 2003 Springer-Verlag Heidelberg 33 45
    • (2003) Lecture Notes in Comput. Sci. , vol.2622 , pp. 33-45
    • Andersson, C.1
  • 6
    • 0000340664 scopus 로고
    • Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and independent set of a chordal graph
    • F. Gavril Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and independent set of a chordal graph SIAM J. Comput. 1 2 1972 180 187
    • (1972) SIAM J. Comput. , vol.1 , Issue.2 , pp. 180-187
    • Gavril, F.1
  • 8
    • 33644913756 scopus 로고    scopus 로고
    • Interference graphs of programs in SSA-form
    • Universität Karlsruhe, June
    • S. Hack, Interference graphs of programs in SSA-form, Tech. Rep. 2005-25, Universität Karlsruhe, June 2005
    • (2005) Tech. Rep. , vol.2005 , Issue.25
    • Hack, S.1
  • 9
    • 84976651458 scopus 로고
    • A fast algorithm for finding dominators in a flowgraph
    • T. Lengauer, and R.E. Tarjan A fast algorithm for finding dominators in a flowgraph Trans. Programm. Languages Systems 1 1 1979 121 141
    • (1979) Trans. Programm. Languages Systems , vol.1 , Issue.1 , pp. 121-141
    • Lengauer, T.1    Tarjan, R.E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.