Graph Coverings

Graph Coverings is a method in compiler design that decomposes an abstract syntax tree into a set of pattern-matching rules over intermediate code graphs to systematically select optimal instruction sequences during code generation.

77

Publications

3.3K

Citations

129

Authors

92

Institutions

Publications per year

2017–2026

7

Authors

129

  1. JL
    Jaeun Lee

    Yeungnam University, South Korea

    8 publications · 211 citations

    8

    h-index

  2. JH
    Jin Ho Kwak

    Pohang University of Science and Technology, South Korea

    8 publications · 211 citations

    8

    h-index

  3. IS
    Iwao Sato

    National Institute of Technology, Oyama College, Japan

    4 publications · 114 citations

    4

    h-index

  4. MK
    Matjaž Kovše

    University of Maribor, Slovenia

    3 publications · 59 citations

    3

    h-index

  5. BC
    Bruno Courcelle

    Université de Bordeaux, France

    3 publications · 108 citations

    3

    h-index

1–5 of 129

Venues

  1. Discrete Mathematics

    13 publications · 581 citations

    12

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 4 publications · 223 citations

    4

    h-index

  3. Journal of Graph Theory

    4 publications · 99 citations

    4

    h-index

  4. Discrete Applied Mathematics

    4 publications · 90 citations

    4

    h-index

  5. IEEE Transactions on Information Theory

    3 publications · 118 citations

    3

    h-index

1–5