Parallel Search Trees

Parallel Search Trees is a computational framework that extends traditional search tree structures by enabling concurrent exploration of multiple branches across parallel processing units to accelerate search operations in large-scale data environments.

35

Publications

985

Citations

107

Authors

56

Institutions

Publications per year

2017–2026

5

Authors

107

  1. AR
    Andrew Rau‐Chaplin

    Dalhousie University, Canada

    2 publications · 25 citations

    2

    h-index

  2. MJ
    Mikhail J. Atallah

    Purdue University West Lafayette, United States

    2 publications · 25 citations

    2

    h-index

  3. RM
    Russ Miller

    University at Buffalo, State University of New York, United States

    2 publications · 25 citations

    2

    h-index

  4. AC
    Adrian Colbrook

    University of Surrey, United Kingdom

    2 publications · 22 citations

    2

    h-index

  5. AS
    A. S. G. Robotham

    The University of Western Australia, Australia

    1 publications · 39 citations

    1

    h-index

1–5 of 107

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 37 citations

    2

    h-index

  2. Publications of the Astronomical Society of Australia

    PASA · 1 publications · 39 citations

    1

    h-index

  3. Annals of Operations Research

    1 publications · 19 citations

    1

    h-index

  4. ACM Transactions on Knowledge Discovery from Data

    TKDD · 1 publications · 11 citations

    1

    h-index

  5. Computer Communications

    1 publications · 11 citations

    1

    h-index

1–5