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

Authors

222

  1. MH
    Maurice Herlihy

    Brown University, United States

    13 publications · 3.9K citations

    13

    h-index

  2. EP
    Erez Petrank

    Technion – Israel Institute of Technology, Israel

    13 publications · 671 citations

    12

    h-index

  3. PT
    Philippas Tsigas

    Chalmers University of Technology, Sweden

    14 publications · 407 citations

    11

    h-index

  4. MM
    Maged M. Michael

    IBM Research - Thomas J. Watson Research Center, United States

    7 publications · 1.1K citations

    7

    h-index

  5. AP
    Aleksandar Prokopec

    École Polytechnique Fédérale de Lausanne, Switzerland

    7 publications · 210 citations

    7

    h-index

1–5 of 222

Venues

  1. ACM SIGPLAN Notices

    12 publications · 266 citations

    10

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 5 publications · 697 citations

    5

    h-index

  3. Information and Computation

    3 publications · 156 citations

    3

    h-index

  4. Formal Aspects of Computing

    2 publications · 27 citations

    2

    h-index

  5. Infoscience (Ecole Polytechnique Fédérale de Lausanne)

    Repository · 2 publications · 25 citations

    2

    h-index

1–5