Parallel Avl Trees

Parallel AVL Trees is a parallel tree algorithm that extends the self-balancing AVL tree structure to support concurrent insertions, deletions, and searches in a distributed or multi-threaded computing environment while maintaining logarithmic height and data consistency through synchronized rotation operations.

4

Publications

170

Citations

6

Authors

6

Institutions

Publications per year

2017–2026

0

Authors

6

  1. DF
    Daniel Ferizovic

    Karlsruhe Institute of Technology, Germany

    2 publications · 66 citations

    2

    h-index

  2. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    2 publications · 66 citations

    2

    h-index

  3. YS
    Yihan Sun

    Carnegie Mellon University, United States

    2 publications · 66 citations

    2

    h-index

  4. ND
    Narsingh Deo

    University of Central Florida, United States

    1 publications · 11 citations

    1

    h-index

  5. MM
    Muralidhar Medidi

    Washington State University, United States

    1 publications · 11 citations

    1

    h-index

1–5 of 6

Venues

  1. Journal of Parallel and Distributed Computing

    1 publications · 11 citations

    1

    h-index

  2. IEEE Transactions on Computers

    1 publications · 93 citations

    1

    h-index

  3. arXiv (Cornell University)

    Repository · 1 publications · 11 citations

    1

    h-index

1–3