Concurrent Deques
Concurrent Deques is a parallel data structure that belongs to the class of double-ended queues and is distinguished by its support for efficient, thread-safe insertion and removal operations at both ends under concurrent access.
6
Publications
242
Citations
14
Authors
9
Institutions
Publications per year
2017–2026
0
Variants
Concurrent Double-ended Queues
Parents
6
Ole Agesen, David Detlefs, Christine H. Flood et al. · 2000 · 38 citations
\bf DCAS-Based Concurrent Deques
Ole Agesen, David Detlefs, Christine H. Flood et al. · Theory of Computing Systems · 2002 · 27 citations
DCAS-based concurrent deques supporting bulk allocation
P. A. Martin, Mark Moir, Guy L. Steele · 2002 · 17 citations
1–5 of 6
14
3
h-index
2
h-index
2
h-index
2
h-index
Institut national de recherche en sciences et technologies du numérique, France
2 publications · 149 citations
2
h-index
1–5 of 14
9
Carnegie Mellon University
Pittsburgh, United States
2 h-index
2 publications
149 citations
Max Planck Institute for Software Systems
Saarbrücken, Germany
2 h-index
2 publications
149 citations
Centre Inria de Saclay
Palaiseau, France
2 h-index
2 publications
149 citations
Oracle (United States)
Austin, United States
2 h-index
6 publications
173 citations
Numerical Method (China)
Tsuen Wan, China
1 h-index
1 publications
129 citations
VMware (United States)
Palo Alto, United States
1 h-index
1 publications
27 citations
Laboratoire de Recherche en Informatique
Gif-sur-Yvette, France
1 h-index
1 publications
129 citations

Tel Aviv University
Tel Aviv, Israel
1 h-index
2 publications
54 citations
1–8 of 9
1 publications · 27 citations
1
h-index
Repository · 1 publications · 11 citations
1
h-index
1 publications · 20 citations
1
h-index
1–3