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

Authors

9

  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. LA
    Lukas Armborst

    University of Twente, Netherlands

    1 publications · 12 citations

    1

    h-index

  5. KP
    Kunsoo Park

    Seoul National University, South Korea

    1 publications · 35 citations

    1

    h-index

1–5 of 9

Venues

  1. Journal of Parallel and Distributed Computing

    1 publications · 23 citations

    1

    h-index

  2. arXiv (Cornell University)

    Repository · 1 publications · 11 citations

    1

    h-index

  3. Theoretical Computer Science

    1 publications · 35 citations

    1

    h-index

1–3