Parallel Tree Algorithms

Parallel Tree Algorithms is a class of parallel algorithms designed to perform computations on tree-structured data by concurrently exploiting the hierarchal and recursive nature of trees to accelerate operations such as traversal, search, and transformation.

488

Publications

43.8K

Citations

1.1K

Authors

463

Institutions

Publications per year

2017–2026

52

Authors

1.1K

  1. UV
    Uzi Vishkin

    University of Maryland, College Park, United States

    9 publications · 1.3K citations

    9

    h-index

  2. AS
    Alexandros Stamatakis

    Heidelberg Institute for Theoretical Studies, Germany

    8 publications · 18K citations

    8

    h-index

  3. JK
    John K. Salmon

    California Institute of Technology, United States

    7 publications · 945 citations

    7

    h-index

  4. MS
    Michael S. Warren

    Los Alamos National Laboratory, United States

    7 publications · 945 citations

    7

    h-index

  5. JY
    Jinn‐Shyong Yang

    National Taipei University of Business, Taiwan

    6 publications · 174 citations

    6

    h-index

1–5 of 1.1K

Venues

  1. Journal of Parallel and Distributed Computing

    21 publications · 681 citations

    17

    h-index

  2. Parallel Computing

    15 publications · 425 citations

    12

    h-index

  3. Theoretical Computer Science

    12 publications · 426 citations

    11

    h-index

  4. Information Processing Letters

    12 publications · 317 citations

    11

    h-index

  5. Bioinformatics

    11 publications · 17.9K citations

    11

    h-index

1–5