Tree Pattern Matching

Tree Pattern Matching is a deterministic parsing technique that belongs to the class of code generation algorithms in compiler design, specifically distinguished by its use of tree-structured patterns to systematically identify and match intermediate representation subtrees against predefined templates for optimal instruction selection.

85

Publications

7.5K

Citations

181

Authors

82

Institutions

Publications per year

2017–2026

1

Authors

181

  1. DS
    Dennis Shasha

    New York University, United States

    5 publications · 359 citations

    5

    h-index

  2. LV
    Laks V. S. Lakshmanan

    University of British Columbia, Canada

    4 publications · 475 citations

    4

    h-index

  3. SR
    S. Rao Kosaraju

    Johns Hopkins University, United States

    3 publications · 144 citations

    3

    h-index

  4. RC
    Richard Cole

    New York University, United States

    3 publications · 101 citations

    3

    h-index

  5. AV
    Alfred V. Aho

    Princeton University, United States

    3 publications · 417 citations

    3

    h-index

1–5 of 181

Venues

  1. Journal of the ACM

    JACM · 3 publications · 568 citations

    3

    h-index

  2. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 3 publications · 246 citations

    3

    h-index

  3. Theoretical Computer Science

    3 publications · 54 citations

    3

    h-index

  4. ACM SIGMOD Record

    2 publications · 82 citations

    2

    h-index

  5. Lecture notes in computer science

    LNCS · Book series · 1 publications · 21 citations

    1

    h-index

1–5