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

Authors

24

  1. RB
    Richard Bornat

    Middlesex University, United Kingdom

    2 publications · 85 citations

    2

    h-index

  2. MP
    Matthew Parkinson

    University of Cambridge, United Kingdom

    2 publications · 85 citations

    2

    h-index

  3. AM
    Adam Morrison

    Tel Aviv University, Israel

    2 publications · 35 citations

    2

    h-index

  4. AH
    Andreas Haas

    University of Salzburg, Austria

    2 publications · 78 citations

    2

    h-index

  5. EG
    Eli Gafni

    University of California, Los Angeles, United States

    2 publications · 35 citations

    2

    h-index

1–5 of 24

Venues

  1. ACM SIGPLAN Notices

    2 publications · 61 citations

    2

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 1 publications · 11 citations

    1

    h-index

  3. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 18 citations

    1

    h-index

  4. Electronic Notes in Theoretical Computer Science

    ENTCS · 1 publications · 18 citations

    1

    h-index

  5. Proceedings of the ACM on Programming Languages

    PACMPL · 1 publications · 26 citations

    1

    h-index

1–5