Concurrent Skip Lists
Concurrent Skip Lists is a concurrent data structure that extends the probabilistic skip list abstraction to support efficient, lock-free search, insertion, and deletion operations under simultaneous access by multiple threads in a shared-memory environment.
28
Publications
1.2K
Citations
64
Authors
31
Institutions
Publications per year
2017–2026
9
Parents
28
A practical concurrent binary search tree
Nathan Bronson, Jared Casper, Hassan Chafi et al. · 2010 · 200 citations
Skiplist-based concurrent priority queues
Nir Shavit, Itay Lotan · 2002 · 99 citations
A non-blocking internal binary search tree
Shane Valentine Howley, Jeremy Jones · 2012 · 95 citations
The SprayList: a scalable relaxed priority queue
Dan Alistarh, Justin Kopinsky, Jerry Li et al. · 2015 · 94 citations · Full text
1–5 of 28
64
5
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 64
31

Tel Aviv University
Tel Aviv, Israel
5 h-index
6 publications
233 citations
Technion – Israel Institute of Technology
Haifa, Israel
4 h-index
8 publications
242 citations
Stanford University
Stanford, United States
3 h-index
9 publications
1.2K citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
7 publications
369 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
2 h-index
2 publications
113 citations
Herzliya Medical Center
Herzliya, Israel
2 h-index
2 publications
46 citations
Florida State University
Tallahassee, United States
1 h-index
2 publications
26 citations

The University of Sydney
Sydney, Australia
1 h-index
3 publications
45 citations
1–8 of 31
3 publications · 95 citations
3
h-index
Repository · 1 publications · 103 citations
1
h-index
TPDS · 1 publications · 13 citations
1
h-index
ITA · 1 publications · 16 citations
1
h-index
Repository · 1 publications · 39 citations
1
h-index
1–5