Bucket Sort
Bucket Sort is a distribution-based sorting algorithm that partitions input elements into a finite number of buckets, each of which is subsequently sorted individually, typically using a subordinate sorting algorithm or by recursive application of Bucket Sort.
62
Publications
2.5K
Citations
149
Authors
69
Institutions
Publications per year
2017–2026
11
Variants
Bin Sort
62
Using multiple hash functions to improve IP lookups
Arndt Bröder, Michael Mitzenmacher · 2002 · 249 citations · Full text
Fast parallel sorting algorithms
D. S. Hirschberg · Communications of the ACM · 1978 · 97 citations · Full text
1–5 of 62
149
3
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 149
69
University of California, Davis
Davis, United States
4 h-index
10 publications
190 citations

University of Helsinki
Helsinki, Finland
3 h-index
5 publications
155 citations
Goethe University Frankfurt
Frankfurt am Main, Germany
3 h-index
3 publications
48 citations

Polytechnic José Antonio Echeverría
Havana, Cuba
2 h-index
2 publications
65 citations
Helsinki Institute for Information Technology
Espoo, Finland
2 h-index
4 publications
104 citations
George Washington University
Washington, United States
2 h-index
3 publications
101 citations

University of Warsaw
Warsaw, Poland
2 h-index
2 publications
25 citations
University of Castilla-La Mancha
Ciudad Real, Spain
2 h-index
4 publications
130 citations
1–8 of 69
3 publications · 52 citations
3
h-index
2 publications · 48 citations
2
h-index
2 publications · 47 citations
2
h-index
1 publications · 33 citations
1
h-index
1 publications · 97 citations
1
h-index
1–5