Concurrent Search Trees

Concurrent Search Trees is a parallel data structure that belongs to the class of search trees, distinguished by its support for simultaneous access and modification by multiple threads through thread-safe operations, enabling efficient and correct querying and updates in concurrent computing environments.

31

Publications

1.5K

Citations

70

Authors

31

Institutions

Publications per year

2017–2026

4

Authors

70

  1. NM
    Neeraj Mittal

    The University of Texas at Dallas, United States

    3 publications · 227 citations

    3

    h-index

  2. NB
    Nathan Bronson

    Stanford University, United States

    2 publications · 266 citations

    2

    h-index

  3. JC
    Jared Casper

    Stanford University, United States

    2 publications · 266 citations

    2

    h-index

  4. EY
    Eran Yahav

    Technion – Israel Institute of Technology, Israel

    2 publications · 104 citations

    2

    h-index

  5. MV
    Martin Vechev

    ETH Zurich, Switzerland

    2 publications · 104 citations

    2

    h-index

1–5 of 70

Venues

  1. ACM SIGPLAN Notices

    3 publications · 112 citations

    3

    h-index

  2. IEEE Transactions on Computers

    2 publications · 118 citations

    2

    h-index

  3. Parallel Computing

    1 publications · 26 citations

    1

    h-index

  4. IEEE Data(base) Engineering Bulletin

    1 publications · 21 citations

    1

    h-index

  5. Very Large Data Bases

    Conference · 1 publications · 14 citations

    1

    h-index

1–5