Parallel Partitioning
Parallel Partitioning is a parallel algorithmic method that belongs to the class of partitioning techniques in sorting algorithms, distinguished by its concurrent division of data elements into disjoint subsets relative to a pivot or set of pivots across multiple processing units to accelerate the sorting process.
235
Publications
18.3K
Citations
537
Authors
233
Institutions
Publications per year
2017–2026
18
Parents
235
A multilevel algorithm for partitioning graphs
Bruce Hendrickson, Robert W. Leland · 1995 · 1.1K citations
1–5 of 235
537
13
h-index
11
h-index
5
h-index
5
h-index
5
h-index
1–5 of 537
233

University of Minnesota
Minneapolis, United States
10 h-index
19 publications
3.5K citations
The Ohio State University
Columbus, United States
7 h-index
13 publications
450 citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
7 publications
204 citations
Syracuse University
Syracuse, United States
5 h-index
14 publications
355 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
5 h-index
12 publications
551 citations

Imperial College London
London, United Kingdom
4 h-index
8 publications
258 citations

Paderborn University
Paderborn, Germany
4 h-index
9 publications
264 citations

University of Greenwich
London, United Kingdom
4 h-index
7 publications
873 citations
1–8 of 233
9 publications · 797 citations
9
h-index
TPDS · 7 publications · 209 citations
7
h-index
7 publications · 949 citations
7
h-index
5 publications · 6.1K citations
5
h-index
Conference · 4 publications · 69 citations
4
h-index
1–5