Shared-memory Data Structures
Shared-Memory Data Structures is a class of parallel data structures designed for concurrent access by multiple processors within a shared-memory system, distinguished by their reliance on coordinated memory accesses and synchronization mechanisms to ensure consistency and efficiency in a unified address space.
242
Publications
19.9K
Citations
606
Authors
200
Institutions
Publications per year
2017–2026
26
Parents
242
Maurice Herlihy, J. Eliot B. Moss · 1993 · 2.2K citations
Separation logic: a logic for shared mutable data structures
John Reynolds · 2003 · 2.2K citations
A fast mutual exclusion algorithm
Leslie Lamport · ACM Transactions on Computer Systems · 1987 · 487 citations · Full text
1–5 of 242
606
9
h-index
IBM Research - Thomas J. Watson Research Center, United States
5 publications · 909 citations
5
h-index
5
h-index
5
h-index
5
h-index
1–5 of 606
200
Carnegie Mellon University
Pittsburgh, United States
9 h-index
18 publications
2.7K citations
Technion – Israel Institute of Technology
Haifa, Israel
9 h-index
16 publications
924 citations
IBM (United States)
Armonk, United States
7 h-index
10 publications
1.1K citations
Stanford University
Stanford, United States
7 h-index
15 publications
793 citations

Tel Aviv University
Tel Aviv, Israel
6 h-index
11 publications
800 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
6 h-index
12 publications
651 citations
Microsoft (United States)
Redmond, United States
6 h-index
6 publications
406 citations
Yale University
New Haven, United States
6 h-index
9 publications
232 citations
1–8 of 200
11 publications · 603 citations
11
h-index
7 publications · 533 citations
7
h-index
5 publications · 462 citations
5
h-index
Conference · 5 publications · 212 citations
5
h-index
4 publications · 82 citations
4
h-index
1–5