Parallel Tree Traversal

Parallel Tree Traversal is a computational method that belongs to the class of tree traversal techniques, distinguished by its simultaneous exploration of multiple branches of a tree structure using concurrent processing units to achieve accelerated computation.

130

Publications

6.6K

Citations

320

Authors

154

Institutions

Publications per year

2017–2026

12

Authors

320

  1. UV
    Uzi Vishkin

    University of Maryland, College Park, United States

    4 publications · 371 citations

    4

    h-index

  2. TM
    Teresa M. Przytycka

    National Center for Biotechnology Information, United States

    4 publications · 290 citations

    4

    h-index

  3. DK
    David Kirkpatrick

    University of British Columbia, Canada

    3 publications · 292 citations

    3

    h-index

  4. MJ
    Mikhail J. Atallah

    Purdue University West Lafayette, United States

    3 publications · 133 citations

    3

    h-index

  5. LL
    Lawrence L. Larmore

    University of Nevada, Las Vegas, United States

    3 publications · 91 citations

    3

    h-index

1–5 of 320

Venues

  1. Parallel Computing

    8 publications · 175 citations

    8

    h-index

  2. Journal of Algorithms

    7 publications · 416 citations

    7

    h-index

  3. Algorithmica

    4 publications · 307 citations

    4

    h-index

  4. International Journal of Parallel Programming

    4 publications · 135 citations

    4

    h-index

  5. Proceedings of the International Conference on Parallel Processing

    Conference · 4 publications · 50 citations

    4

    h-index

1–5