Concurrent Stacks
Concurrent Stacks is a concurrent data structure that belongs to the class of thread-safe abstract data types, specifically distinguished by its implementation of stack semantics—Last-In-First-Out (LIFO) ordering—augmented with synchronization mechanisms to ensure correct and scalable access by multiple threads simultaneously.
14
Publications
452
Citations
24
Authors
23
Institutions
Publications per year
2017–2026
2
Variants
Concurrent Stack
14
Mark Moir, Nir Shavit · 2004 · 69 citations
A Scalable, Correct Time-Stamped Stack
Mike Dodds, Andreas Haas, Christoph Kirsch · 2014 · 60 citations · Full text
Modular verification of a non-blocking stack
Matthew Parkinson, Richard Bornat, Peter W. O’Hearn · 2007 · 42 citations
1–5 of 14
24
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 24
23

University of York
York, United Kingdom
2 h-index
2 publications
78 citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
2 publications
35 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
4 publications
70 citations

Middlesex University
London, United Kingdom
2 h-index
2 publications
85 citations
Queen Mary University of London
London, United Kingdom
2 h-index
2 publications
85 citations

University of Salzburg
Salzburg, Austria
2 h-index
4 publications
156 citations
University of Cambridge
Cambridge, United Kingdom
2 h-index
2 publications
85 citations

University of Rochester
Rochester, United States
2 h-index
4 publications
80 citations
1–8 of 23
2 publications · 61 citations
2
h-index
TPDS · 1 publications · 11 citations
1
h-index
Repository · 1 publications · 18 citations
1
h-index
ENTCS · 1 publications · 18 citations
1
h-index
PACMPL · 1 publications · 26 citations
1
h-index
1–5