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)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Panu Horsmalahti
- ArXiv
- 2012

Bucket sort and RADIX sort are two well-known integer sorting algorithms. This paper measures empirically what is the time usageâ€¦Â (More)

Is this relevant?

2012

2012

- Frank Dehne, Hamidreza Zaboli
- Parallel Processing Letters
- 2012

We demonstrate that parallel deterministic sample sort for many-core GPUs (GPU Bucket Sort) is not only considerably faster thanâ€¦Â (More)

Is this relevant?

2009

2009

- Fang Liu, Meng-Cheng Huang, Xuehui Liu, Enhua Wu
- High Performance Graphics
- 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)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Erik Sintorn, Ulf Assarsson
- J. Parallel Distrib. Comput.
- 2008

This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficientlyâ€¦Â (More)

Is this relevant?

2008

2008

- Tomasz Rozen, Krzysztof Boryczko, Witold Alda
- Journal of WSCG
- 2008

We present an adoption of the bucket sort algorithm capable of running entirely on GPU architecture. Our implementation employsâ€¦Â (More)

Is this relevant?

2004

2004

- Kazumaro Aoki, Hiroki R Ueda
- ASIACRYPT
- 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

- Apostolos Burnetas, Daniel Solow, Rishi Agarwal
- Acta Informatica
- 1997

Various methods, such as address-calculation sorts, distribution counting sorts, radix sorts, and bucket sorts, use the values ofâ€¦Â (More)

Is this relevant?

1997

1997

- Michael Cox, Narendra Bhandari
- Workshop on Graphics Hardware
- 1997

Wrcket rendering is a technique whereby a scene is sorted into screen-space tiles and each tile is rendered independently in turnâ€¦Â (More)

Is this relevant?

1988

1988

- Bogdan S. Chlebus
- Inf. Process. Lett.
- 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

- Torben Hagerup
- Inf. Comput.
- 1987

It is well known (Ajtai et al., 1983; Cole, 1986; Leighton, 1984) that n objects drawn from an arbitrary totally ordered universeâ€¦Â (More)

Is this relevant?