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

Authors

32

  1. VB
    Vincent Bloemen

    University of Twente, Netherlands

    2 publications · 44 citations

    2

    h-index

  2. JV
    Jaco van de Pol

    University of Twente, Netherlands

    2 publications · 44 citations

    2

    h-index

  3. AL
    Alfons Laarman

    University of Twente, Netherlands

    2 publications · 44 citations

    2

    h-index

  4. MB
    Martin Burtscher

    Texas State University, United States

    1 publications · 26 citations

    1

    h-index

  5. HW
    Heather Woll

    University of Washington, United States

    1 publications · 106 citations

    1

    h-index

1–5 of 32

Venues

  1. 1

    h-index

  2. International Journal of Parallel Programming

    1 publications · 25 citations

    1

    h-index

  3. Theoretical Computer Science

    1 publications · 231 citations

    1

    h-index

  4. Computer Physics Communications

    1 publications · 19 citations

    1

    h-index

  5. ACM SIGPLAN Notices

    1 publications · 14 citations

    1

    h-index

1–5