Lock-free Algorithms

Lock-Free Algorithms is a concurrency control method that ensures system-wide progress by guaranteeing that at least one thread makes progress in a finite number of steps, distinguishing it from blocking and wait-free synchronization techniques through its non-reliance on locks and its avoidance of indefinite thread suspension.

135

Publications

13.5K

Citations

231

Authors

103

Institutions

Publications per year

2017–2026

20

Authors

231

  1. PT
    Philippas Tsigas

    Chalmers University of Technology, Sweden

    17 publications · 545 citations

    13

    h-index

  2. NS
    Nir Shavit

    Tel Aviv University, Israel

    9 publications · 703 citations

    9

    h-index

  3. EP
    Erez Petrank

    Technion – Israel Institute of Technology, Israel

    8 publications · 360 citations

    8

    h-index

  4. MP
    Marina Papatriantafilou

    Chalmers University of Technology, Sweden

    8 publications · 216 citations

    8

    h-index

  5. HS
    Håkan Sundell

    Vanderbilt University, United States

    6 publications · 202 citations

    6

    h-index

1–5 of 231

Venues

  1. ACM SIGPLAN Notices

    10 publications · 195 citations

    10

    h-index

  2. Journal of Parallel and Distributed Computing

    4 publications · 345 citations

    4

    h-index

  3. arXiv (Cornell University)

    Repository · 3 publications · 1.3K citations

    3

    h-index

  4. Information and Computation

    3 publications · 156 citations

    3

    h-index

  5. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 2 publications · 209 citations

    2

    h-index

1–5