Wait-Free Algorithms is a concurrency control method in shared-memory parallelism that guarantees every thread will complete its operation in a finite number of steps regardless of the execution speed or behavior of other threads.
139
Publications
7.5K
Citations
190
Authors
107
Institutions
Publications per year
2017–2026
8
Publications
139
Maurice Herlihy · ACM Transactions on Programming Languages and Systems · 1991 · 1.8K citations · Full text
Atomic snapshots of shared memory
Yehuda Afek, Hagit Attiya, Danny Dolev et al. · Journal of the ACM · 1993 · 453 citations · Full text
A methodology for implementing highly concurrent data structures
Maurice Herlihy · 1990 · 123 citations · Full text
1–5 of 139
Authors
190
- HA
14
h-index
- MH
12
h-index
- SR
8
h-index
- NS
8
h-index
- EP
7
h-index
1–5 of 190
Institutions
107
Technion – Israel Institute of Technology
Haifa, Israel
18 h-index
39 publications
2K citations
University of Toronto
Toronto, Canada
9 h-index
10 publications
255 citations
Universidad Nacional Autónoma de México
Mexico City, Mexico
8 h-index
11 publications
447 citations
Tel Aviv University
Tel Aviv, Israel
8 h-index
11 publications
1.6K citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
6 h-index
8 publications
231 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
5 h-index
8 publications
394 citations
University of California, Los Angeles
Los Angeles, United States
5 h-index
6 publications
812 citations
Microsoft (United States)
Redmond, United States
4 h-index
5 publications
187 citations
1–8 of 107
Venues
- Journal of the ACM
JACM · 11 publications · 974 citations
11
h-index
- Distributed Computing
10 publications · 234 citations
10
h-index
- ACM SIGPLAN Notices
7 publications · 272 citations
7
h-index
- SIAM Journal on Computing
6 publications · 599 citations
6
h-index
- International Journal of Parallel Programming
3 publications · 52 citations
3
h-index
1–5