Bucket sort

Known as: Range sort, Bucket array, Postman sort 
Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2018
0246819772018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Bucket sort and RADIX sort are two well-known integer sorting algorithms. This paper measures empirically what is the time usage… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table 2
Is this relevant?
2012
2012
We demonstrate that parallel deterministic sample sort for many-core GPUs (GPU Bucket Sort) is not only considerably faster than… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
In this paper we present an efficient algorithm for multi-layer depth peeling via bucket sort of fragments on GPU, which makes it… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently… (More)
  • figure 1
  • figure 2
  • figure 7
  • figure 8
  • figure 9
Is this relevant?
2008
2008
We present an adoption of the bucket sort algorithm capable of running entirely on GPU architecture. Our implementation employs… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2004
2004
This paper proposes a new sieving algorithm that employs a bucket sort as a part of a factoring algorithm such as the number… (More)
Is this relevant?
1997
1997
Various methods, such as address-calculation sorts, distribution counting sorts, radix sorts, and bucket sorts, use the values of… (More)
  • figure 2
  • table 2
  • figure 3
Is this relevant?
1997
1997
Wrcket rendering is a technique whereby a scene is sorted into screen-space tiles and each tile is rendered independently in turn… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 8
Is this relevant?
1988
1988
Many parallel algorithms have been developed to sort n keys in O(log n) time on a PRAM (see [2,4,7,12,14,15,16]). A special case… (More)
Is this relevant?
1987
1987
It is well known (Ajtai et al., 1983; Cole, 1986; Leighton, 1984) that n objects drawn from an arbitrary totally ordered universe… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?