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
Implementing Radix Sort on Emu 1
This paper discusses the implementation of radix sort on Emu Solutions’ Emu 1 system. Sorting is an important building block for… 
Review
2012
Review
2012
‘ Review of Radix Sort & Proposed Modified Radix Sort for Heterogeneous Data Set in Distributed Computing Environment ’
We have proposed a Modified Pure Radix Sort for Large Heterogeneous Data Set. In this research paper we discuss the problems of… 
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… 
1999
1999
Communication conscious radix sort
The exploitation of data locality in parallel computers is paramount to reduce the memory traffic and communication among… 
1998
1998
An Optimal Parallel Radix Sorting Algorithm on Two and Three Dimensional meshes for VLSI Computation
We consider radix sorting problems on two-dimensional mesh and three-dimensional mesh. By employing the radix sorting, we removed… 
1997
1997
Fast Parallel Radix Sort Using a Reconfigurable Mesh
In this paper, we present a parallel SIMD algorithm for radix sorting of N numbers of w bits each, taking O(w + N1/4) time with… 
1996
1996
Fast deterministic sorting on large parallel machines
Many sorting algorithms that perform well on uniformly distributed data suffer significant performance degradation on non-random… 
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)