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

Authors

149

  1. JD
    John D. Owens

    University of California, Davis, United States

    3 publications · 48 citations

    3

    h-index

  2. SA
    Saman Ashkiani

    University of California, Davis, United States

    3 publications · 48 citations

    3

    h-index

  3. UM
    Ulrich Meyer

    Goethe University Frankfurt, Germany

    3 publications · 48 citations

    3

    h-index

  4. JA
    Juan A. Aledo

    University of Castilla-La Mancha, Spain

    2 publications · 65 citations

    2

    h-index

  5. AG
    Andreas Gleißner

    University of Passau, Germany

    2 publications · 50 citations

    2

    h-index

1–5 of 149

Venues

  1. Information Processing Letters

    3 publications · 52 citations

    3

    h-index

  2. Theoretical Computer Science

    2 publications · 48 citations

    2

    h-index

  3. Acta Informatica

    2 publications · 47 citations

    2

    h-index

  4. IBM Journal of Research and Development

    1 publications · 33 citations

    1

    h-index

  5. Communications of the ACM

    1 publications · 97 citations

    1

    h-index

1–5