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
Parents
4
Concurrent Search and Insertion in AVL Trees
Ellis Ellis · IEEE Transactions on Computers · 1980 · 93 citations
Just Join for Parallel Ordered Sets
Guy E. Blelloch, Daniel Ferizovic, Yihan Sun · 2016 · 55 citations
Parallel Ordered Sets Using Join
Guy E. Blelloch, Daniel Ferizovic, Yihan Sun · arXiv (Cornell University) · 2016 · 11 citations · Full text
1–4 of 4
6
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 6
6
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
132 citations
University of Oregon
Eugene, United States
1 h-index
1 publications
93 citations

Northern Arizona University
Flagstaff, United States
1 h-index
1 publications
11 citations

University of Rochester
Rochester, United States
1 h-index
1 publications
93 citations

University of Central Florida
Orlando, United States
1 h-index
1 publications
11 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
1 h-index
1 publications
55 citations
1–6 of 6
1 publications · 11 citations
1
h-index
1 publications · 93 citations
1
h-index
Repository · 1 publications · 11 citations
1
h-index
1–3