Tree Covering
Tree Covering is a method in compiler code generation that systematically partitions an abstract syntax tree into disjoint, node-disjoint subtrees corresponding to patterns implementable by target machine instructions, distinguishing it from alternative instruction selection strategies by emphasizing pattern-matching completeness and optimality guarantees over heuristic matching.
14
Publications
363
Citations
34
Authors
17
Institutions
Publications per year
2017–2026
2
Parents
14
Packing and covering a tree by subtrees
Imre Bárány, Laurence A. Wolsey, Jack Edmonds · COMBINATORICA · 1986 · 56 citations
1–5 of 14
34
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 34
17
TU Dortmund University
Dortmund, Germany
2 h-index
4 publications
112 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
1 h-index
2 publications
20 citations
University of Nebraska–Lincoln
Lincoln, United States
1 h-index
6 publications
144 citations
Université Libre de Bruxelles
Brussels, Belgium
1 h-index
2 publications
64 citations

University of Helsinki
Helsinki, Finland
1 h-index
1 publications
11 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
56 citations
Sandia National Laboratories California
Livermore, United States
1 h-index
1 publications
17 citations

Peking University
Beijing, China
1 h-index
3 publications
141 citations
1–8 of 17
2 publications · 36 citations
2
h-index
1 publications · 32 citations
1
h-index
1 publications · 52 citations
1
h-index
1 publications · 17 citations
1
h-index
1 publications · 47 citations
1
h-index
1–5