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
Parents
31
A practical concurrent binary search tree
Nathan Bronson, Jared Casper, Hassan Chafi et al. · 2010 · 200 citations
Fast concurrent lock-free binary search trees
Aravind Natarajan, Neeraj Mittal · 2014 · 180 citations
Concurrent search and insertion in 2?3 trees
Carla Schlatter Ellis · Acta Informatica · 1980 · 96 citations
A non-blocking internal binary search tree
Shane Valentine Howley, Jeremy Jones · 2012 · 95 citations
Concurrent Search and Insertion in AVL Trees
Ellis Ellis · IEEE Transactions on Computers · 1980 · 93 citations
1–5 of 31
70
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 70
31
Technion – Israel Institute of Technology
Haifa, Israel
4 h-index
7 publications
362 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
7 publications
156 citations
The University of Texas at Dallas
Richardson, United States
3 h-index
6 publications
454 citations
ETH Zurich
Zurich, Switzerland
2 h-index
2 publications
104 citations
University of Oregon
Eugene, United States
2 h-index
2 publications
189 citations

Uppsala University
Uppsala, Sweden
2 h-index
5 publications
86 citations
Stanford University
Stanford, United States
2 h-index
8 publications
1.1K citations
Microsoft (United States)
Redmond, United States
2 h-index
2 publications
86 citations
1–8 of 31
3 publications · 112 citations
3
h-index
2 publications · 118 citations
2
h-index
1 publications · 26 citations
1
h-index
1 publications · 21 citations
1
h-index
Conference · 1 publications · 14 citations
1
h-index
1–5