Concurrent Tree Data Structures is a class of tree-based data organization methods designed to support simultaneous access and modification by multiple processes or threads, distinguished by their implementation of synchronization mechanisms that ensure correctness and consistency under parallel execution.
71
Publications
3.6K
Citations
139
Authors
71
Institutions
Publications per year
2017–2026
6
Parents
Publications
71
Ismail Oukid, Johan Lasperas, Anisoara Nica et al. · 2016 · 317 citations · Full text
A practical concurrent binary search tree
Nathan Bronson, Jared Casper, Hassan Chafi et al. · 2010 · 200 citations
Nir Shavit, Asaph Zemach · ACM Transactions on Computer Systems · 1996 · 118 citations · Full text
1–5 of 71
Authors
139
- DL
4
h-index
- MJ
4
h-index
- VS
4
h-index
- PL
3
h-index
- EP
3
h-index
1–5 of 139
Institutions
71
Technion – Israel Institute of Technology
Haifa, Israel
7 h-index
13 publications
684 citations
University of Wisconsin–Madison
Madison, United States
5 h-index
7 publications
297 citations
Tel Aviv University
Tel Aviv, Israel
4 h-index
9 publications
392 citations
Microsoft (United States)
Redmond, United States
4 h-index
4 publications
128 citations
Northeastern University
Boston, United States
3 h-index
3 publications
152 citations
IBM (United States)
Armonk, United States
2 h-index
2 publications
85 citations
Stanford University
Stanford, United States
2 h-index
8 publications
1.1K citations
University of Helsinki
Helsinki, Finland
2 h-index
2 publications
44 citations
1–8 of 71
Venues
- ACM Transactions on Database Systems
TODS · 3 publications · 833 citations
3
h-index
- ACM SIGPLAN Notices
3 publications · 97 citations
3
h-index
- Concurrency and Computation Practice and Experience
2 publications · 48 citations
2
h-index
- IEEE Transactions on Knowledge and Data Engineering
TKDE · 2 publications · 81 citations
2
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 2 publications · 36 citations
2
h-index
1–5