Parallel Select Algorithms
Parallel Select Algorithms is a computational method that belongs to the class of parallel search algorithms and is specifically distinguished by its ability to efficiently determine the k-th smallest element in an unordered dataset through concurrent processing across multiple processors or threads.
18
Publications
738
Citations
30
Authors
25
Institutions
Publications per year
2017–2026
0
Parents
18
Computing with Noisy Information
Uriel Feige, Prabhakar Raghavan, David Peleg et al. · SIAM Journal on Computing · 1994 · 314 citations
Load balancing, selection sorting on the hypercube
C. Gregory Plaxton · 1989 · 57 citations · Full text
An optimal algorithm for parallel selection
Selim G. Akl · Information Processing Letters · 1984 · 41 citations
1–5 of 18
30
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 30
25

Cornell University
Ithaca, United States
2 h-index
6 publications
78 citations
IBM (United States)
Armonk, United States
2 h-index
2 publications
63 citations
University of Florida
Gainesville, United States
2 h-index
2 publications
35 citations
Universidade de São Paulo
São Paulo, Brazil
2 h-index
4 publications
52 citations
Stanford University
Stanford, United States
2 h-index
2 publications
82 citations
University of California San Diego
San Diego, United States
2 h-index
2 publications
63 citations

Hungarian Academy of Sciences
Budapest, Hungary
2 h-index
2 publications
63 citations
BASF (United States)
Florham Park, United States
1 h-index
1 publications
12 citations
1–8 of 25
TPDS · 1 publications · 20 citations
1
h-index
1 publications · 41 citations
1
h-index
Conference · 1 publications · 11 citations
1
h-index
Conference · 1 publications · 12 citations
1
h-index
1 publications · 35 citations
1
h-index
1–5