Shared-memory Graph Algorithms
Shared-Memory Graph Algorithms is a class of parallel graph algorithms designed to operate on shared-memory multiprocessor systems, where multiple processing units concurrently access and modify a common graph data structure to exploit data locality and reduce communication overhead inherent in distributed-memory models.
69
Publications
5.1K
Citations
198
Authors
87
Institutions
Publications per year
2017–2026
23
Parents
69
Julian Shun, Guy E. Blelloch · 2013 · 808 citations
Pankaj Gupta, Ashish Goel, Jimmy Lin et al. · 2013 · 472 citations
Julian Shun, Guy E. Blelloch · ACM SIGPLAN Notices · 2013 · 218 citations
1–5 of 69
198
7
h-index
5
h-index
4
h-index
Pacific Northwest National Laboratory, United States
3 publications · 104 citations
3
h-index
3
h-index
1–5 of 198
87
Carnegie Mellon University
Pittsburgh, United States
7 h-index
21 publications
3K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
6 h-index
14 publications
646 citations
Georgia Institute of Technology
Atlanta, United States
6 h-index
13 publications
439 citations
IBM (United States)
Armonk, United States
4 h-index
4 publications
561 citations
University of California, Berkeley
Berkeley, United States
4 h-index
11 publications
1.7K citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
12 publications
406 citations

Carleton University
Ottawa, Canada
3 h-index
3 publications
143 citations
The University of Texas at Austin
Austin, United States
3 h-index
10 publications
165 citations
1–8 of 87
Repository · 4 publications · 248 citations
4
h-index
PVLDB · 4 publications · 158 citations
4
h-index
2 publications · 177 citations
2
h-index
2 publications · 474 citations
2
h-index
1 publications · 12 citations
1
h-index
1–5