Parallel Red-black Trees
Parallel Red-Black Trees is a concurrent data structure that extends the classical red-black tree by enabling parallel execution of insertion, deletion, and search operations through fine-grained locking or lock-free synchronization, thereby preserving the binary search tree ordering and balanced height guarantees under concurrent access.
5
Publications
136
Citations
9
Authors
5
Institutions
Publications per year
2017–2026
1
Parents
5
Just Join for Parallel Ordered Sets
Guy E. Blelloch, Daniel Ferizovic, Yihan Sun · 2016 · 55 citations
Parallel algorithms for red–black trees
Heejin Park, Kunsoo Park · Theoretical Computer Science · 2001 · 35 citations
Parallel Ordered Sets Using Join
Guy E. Blelloch, Daniel Ferizovic, Yihan Sun · arXiv (Cornell University) · 2016 · 11 citations · Full text
1–5 of 5
9
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 9
5
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
132 citations
Pontificia Universidad Católica de Chile
Santiago, Chile
1 h-index
2 publications
46 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
1 h-index
1 publications
55 citations

University of Twente
Enschede, The Netherlands
1 h-index
2 publications
24 citations
Seoul National University
Seoul, South Korea
1 h-index
2 publications
70 citations
1–5 of 5
1 publications · 23 citations
1
h-index
Repository · 1 publications · 11 citations
1
h-index
1 publications · 35 citations
1
h-index
1–3