Radix sort

Known as: Bucket trie, Radix sorting, Radixsort 
In computer science, radix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1955-2018
0102019552017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
The need to rank and order data is pervasive, and many algorithms are fundamentally dependent upon sorting and partitioning… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 5
Is this relevant?
2010
2010
We develop a radix sort algorithm, GRS, suitable to sort multifield records on a graphics processing unit (GPU). We assume the By… (More)
  • figure 1
  • figure 2
  • figure 10
  • figure 11
  • figure 9
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We describe the design of high-performance parallel radix sort and merge sort routines for manycore GPUs, taking advantage of the… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2003
2003
We focus on the improvement of data locality for the in-core sequential Radix sort algorithm for 32-bit positive integer keys. We… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2001
2001
We demonstrate the importance of reducing misses in the translation-lookaside buffer (TLB) for obtaining good performance on… (More)
Is this relevant?
2000
2000
Load balanced parallel radix sort solved the load imbalance problem present in parallel radix sort. By redistributing the keys in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
The exploitation of data locality in parallel computers is paramount to reduce the memory traffic and communication among… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
1993
1993
Radix sorting methods have excellent asymptotic performance on string data, for which comparison is not a unit-time operation… (More)
  • figure 1.1
  • figure 4.1
  • figure 4.2
  • figure 4.3
  • figure 4.4
Is this relevant?
1992
1992
Almost all computers regularly sort data. Many different sort algorithms have therefore been proposed, and the properties of… (More)
  • figure 1
  • figure 3
  • table 1
  • table 2
  • table 3
Is this relevant?