Concurrent Linked Lists is a parallel data structure that extends the linked list abstraction to support efficient, thread-safe insertion, deletion, and traversal operations under concurrent access by multiple threads through synchronization mechanisms such as locks, lock-free atomic operations, or transactional memory.
12
Publications
563
Citations
41
Authors
16
Institutions
Publications per year
2017–2026
2
Parents
Publications
12
Real‐Time Concurrent Linked List Construction on the GPU
Jason Yang, Justin Hensley, Holger Grün et al. · Computer Graphics Forum · 2010 · 148 citations
Proving correctness of highly-concurrent linearisable objects
Viktor Vafeiadis, Maurice Herlihy, Tony Hoare et al. · 2006 · 105 citations · Full text
Mark Moir, Nir Shavit · 2004 · 69 citations
Ole Agesen, David Detlefs, Christine H. Flood et al. · 2000 · 38 citations
1–5 of 12
Authors
41
- MH
2
h-index
- NS
2
h-index
- RG
2
h-index
- AG
1
h-index
- RI
1
h-index
1–5 of 41
Institutions
16
University of Cambridge
Cambridge, United Kingdom
2 h-index
2 publications
129 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
2 h-index
2 publications
117 citations
Brown University
Providence, United States
2 h-index
5 publications
189 citations
Microsoft (United States)
Redmond, United States
1 h-index
1 publications
12 citations
IBM Research - Zurich
Rüschlikon, Switzerland
1 h-index
1 publications
39 citations
ETH Zurich
Zurich, Switzerland
1 h-index
1 publications
31 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
1 h-index
1 publications
105 citations
Oracle (United States)
Austin, United States
1 h-index
1 publications
38 citations
1–8 of 16
Venues
- Computer Graphics Forum
1 publications · 148 citations
1
h-index
- Infoscience (Ecole Polytechnique Fédérale de Lausanne)
Repository · 1 publications · 39 citations
1
h-index
1–2