Skip to search formSkip to main contentSkip to account menu

Radix sort

Known as: Radix (disambiguation), RadixSort, Radix sorting 
In computer science, radix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual… 
Wikipedia (opens in a new tab)

Related topics

Related topics

48 relations
American flag sortBitonic sorterBreadth-first searchBubble sort

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
On Image Forgery Detection Using Two Dimensional Discrete Cosine Transform and Statistical Moments
2013
2013
Pharmacological effects and chemical components of Radix Glehniae: research advances
Germplasm of Radix Glehniae derived from Glehnia littoralis is rich in resources,complex in chemical compositions,and has obvious… 
2011
2011
Introduction to GPU Radix Sort
The prefix sum is the sum of all values in preceding locations in the sequence: in this case those to the left of the current… 
2007
2007
Cache Efficient Radix Sort for String Sorting
In this paper, we propose CRadix sort, a new string sorting algorithm based on MSD radix sort. CRadix sort causes fewer cache… 
Highly Cited
2000
Highly Cited
2000
Partitioned Parallel Radix Sort
Load balanced parallel radix sort solved the load imbalance problem present in parallel radix sort. Redistributing the keys in… 
1999
1999
Communication conscious radix sort
The exploitation of data locality in parallel computers is paramount to reduce the memory traffic and communication among… 
Highly Cited
1998
Highly Cited
1998
Load balanced parallel radix sort
Radix sort suffers from the unequal number of input keys due to the unknown characteristics of input keys. We present in this… 
1991
1991
Efficient Bitonic Sorting of Large Arrays on the MasPar MP-1
The problem of sorting a collection of values on a mesh-connected distributed-memory SIMD computer using variants of Batcher's… 
1990
1990
Efficient Histogramming on Hypercube SIMD Machines
1966
1966
Internal Sorting by Radix Plus Sifting
A method is proposed for internal sorting which has the property that the expected time required per record, to sort n records… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)