Parallel Binary Search Trees

Parallel Binary Search Trees is a parallel algorithmic framework that extends the traditional binary search tree data structure by enabling concurrent insert, delete, and search operations through synchronization mechanisms and structural invariants to ensure correctness and performance in multiprocessor environments.

6

Publications

167

Citations

15

Authors

11

Institutions

Publications per year

2017–2026

1

Authors

15

  1. SA
    Srinivas Aluru

    Iowa State University, United States

    1 publications · 27 citations

    1

    h-index

  2. MA
    Maya Arbel-Raviv

    Institute of Science and Technology Austria, Austria

    1 publications · 10 citations

    1

    h-index

  3. DF
    Daniel Ferizovic

    Karlsruhe Institute of Technology, Germany

    1 publications · 11 citations

    1

    h-index

  4. SV
    Shane Valentine Howley

    Trinity College Dublin, Ireland

    1 publications · 95 citations

    1

    h-index

  5. IA
    I. Al-Furajh

    Iowa State University, United States

    1 publications · 27 citations

    1

    h-index

1–5 of 15

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 1 publications · 27 citations

    1

    h-index

  2. arXiv (Cornell University)

    Repository · 1 publications · 11 citations

    1

    h-index

1–2