Parallel Tree Search

Parallel Tree Search is a parallel algorithmic method that systematically explores the nodes of a tree structure concurrently across multiple processing units to accelerate the search process while maintaining correctness and consistency.

77

Publications

4.1K

Citations

164

Authors

84

Institutions

Publications per year

2017–2026

14

Authors

164

  1. GK
    George Karypis

    University of Minnesota, United States

    3 publications · 67 citations

    3

    h-index

  2. VK
    Vipin Kumar

    University of Minnesota, United States

    3 publications · 67 citations

    3

    h-index

  3. KN
    Konstantinos Nikitopoulos

    University of Surrey, United Kingdom

    3 publications · 82 citations

    3

    h-index

  4. YL
    Yuanfu Luo

    National University of Singapore, Singapore

    2 publications · 69 citations

    2

    h-index

  5. RM
    Robert M. Hyatt

    St. Vincent's Birmingham, United States

    2 publications · 39 citations

    2

    h-index

1–5 of 164

Venues

  1. 5

    h-index

  2. Parallel Computing

    4 publications · 61 citations

    4

    h-index

  3. ICGA Journal

    4 publications · 73 citations

    4

    h-index

  4. 3

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 3 publications · 102 citations

    3

    h-index

1–5