Wait-Free Data Structures is a class of concurrent data structures in which every operation is guaranteed to complete in a finite number of steps, regardless of the behavior or scheduling of other threads, thereby ensuring non-blocking progress for all processes.
72
Publications
5.4K
Citations
97
Authors
60
Institutions
Publications per year
2017–2026
5
Parents
Publications
72
Maurice Herlihy · ACM Transactions on Programming Languages and Systems · 1991 · 1.8K citations · Full text
Transactional lock-free execution of lock-based programs
Ravi Rajwar, James Goodman · 2002 · 316 citations
1–5 of 72
Authors
97
- MH
10
h-index
- EP
7
h-index
- AK
5
h-index
- RR
4
h-index
- JM
4
h-index
1–5 of 97
Institutions
60
Technion – Israel Institute of Technology
Haifa, Israel
10 h-index
20 publications
715 citations
University of Toronto
Toronto, Canada
6 h-index
8 publications
232 citations
Rice University
Houston, United States
4 h-index
8 publications
263 citations
University of Central Florida
Orlando, United States
4 h-index
11 publications
168 citations
University of Wisconsin–Madison
Madison, United States
4 h-index
8 publications
778 citations
Tel Aviv University
Tel Aviv, Israel
3 h-index
5 publications
421 citations
The University of Texas at Austin
Austin, United States
3 h-index
4 publications
101 citations
Foundation for Research and Technology Hellas
Heraklion, Greece
3 h-index
5 publications
137 citations
1–8 of 60
Venues
- ACM SIGPLAN Notices
7 publications · 268 citations
7
h-index
- Distributed Computing
4 publications · 93 citations
4
h-index
- Journal of the ACM
JACM · 2 publications · 80 citations
2
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 2 publications · 27 citations
2
h-index
- Information Processing Letters
2 publications · 27 citations
2
h-index
1–5