Parallel Union-find
Parallel Union-Find is a concurrent algorithmic construct in disjoint set data structures that enables multiple processing threads to perform union and find operations simultaneously while maintaining consistency through synchronization mechanisms, thereby accelerating performance in parallel computing environments.
15
Publications
685
Citations
32
Authors
30
Institutions
Publications per year
2017–2026
4
15
Wait-free parallel algorithms for the union-find problem
Richard Anderson, Heather Woll · 1991 · 106 citations
1–5 of 15
32
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 32
30

TU Wien
Vienna, Austria
2 h-index
2 publications
44 citations

University of Twente
Enschede, The Netherlands
2 h-index
4 publications
88 citations
The University of Tokyo
Tokyo, Japan
1 h-index
2 publications
38 citations
University of California San Diego
San Diego, United States
1 h-index
1 publications
106 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
1 h-index
1 publications
11 citations
Fujitsu (Japan)
Kawasaki, Japan
1 h-index
1 publications
19 citations
Northwestern University
Evanston, United States
1 h-index
5 publications
110 citations
University of Maryland, College Park
College Park, United States
1 h-index
1 publications
72 citations
1–8 of 30
Repository · 1 publications · 31 citations
1
h-index
1 publications · 25 citations
1
h-index
1 publications · 231 citations
1
h-index
1 publications · 19 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5