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
Parents
6
A non-blocking internal binary search tree
Shane Valentine Howley, Jeremy Jones · 2012 · 95 citations
Parallel construction of near optimal binary trees
David Kirkpatrick, Teresa M. Przytycka · 1990 · 11 citations
Parallel Ordered Sets Using Join
Guy E. Blelloch, Daniel Ferizovic, Yihan Sun · arXiv (Cornell University) · 2016 · 11 citations · Full text
1–5 of 6
15
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 15
11

Université de Picardie Jules Verne
Amiens, France
1 h-index
2 publications
26 citations
Technion – Israel Institute of Technology
Haifa, Israel
1 h-index
1 publications
10 citations
University of Florida
Gainesville, United States
1 h-index
1 publications
27 citations
Iowa State University
Ames, United States
1 h-index
1 publications
27 citations

Tel Aviv University
Tel Aviv, Israel
1 h-index
1 publications
10 citations
Northwestern University
Evanston, United States
1 h-index
1 publications
27 citations
Institute of Science and Technology Austria
Klosterneuburg, Austria
1 h-index
1 publications
10 citations

Trinity College Dublin
Dublin, Ireland
1 h-index
2 publications
190 citations
1–8 of 11
TPDS · 1 publications · 27 citations
1
h-index
Repository · 1 publications · 11 citations
1
h-index
1–2