Lock-free Data Structures
Lock-Free Data Structures is a class of concurrent data structures designed such that each thread can make progress without requiring mutual exclusion, ensuring system-wide progress through non-blocking synchronization techniques even under contention.
140
Publications
11.4K
Citations
222
Authors
107
Institutions
Publications per year
2017–2026
27
140
1–5 of 140
222
13
h-index
12
h-index
11
h-index
IBM Research - Thomas J. Watson Research Center, United States
7 publications · 1.1K citations
7
h-index
École Polytechnique Fédérale de Lausanne, Switzerland
7 publications · 210 citations
7
h-index
1–5 of 222
107
Technion – Israel Institute of Technology
Haifa, Israel
14 h-index
31 publications
1.5K citations
Chalmers University of Technology
Gothenburg, Sweden
12 h-index
31 publications
887 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
7 h-index
15 publications
518 citations
Brown University
Providence, United States
6 h-index
6 publications
688 citations

Tel Aviv University
Tel Aviv, Israel
6 h-index
10 publications
1.6K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
5 h-index
5 publications
1.2K citations

University of Massachusetts Amherst
Amherst Center, United States
5 h-index
6 publications
3.6K citations

Victoria University of Wellington
Wellington, New Zealand
4 h-index
6 publications
211 citations
1–8 of 107
12 publications · 266 citations
10
h-index
TPDS · 5 publications · 697 citations
5
h-index
3 publications · 156 citations
3
h-index
2 publications · 27 citations
2
h-index
Repository · 2 publications · 25 citations
2
h-index
1–5