Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,352,568 papers from all fields of science
Search
Sign In
Create Free Account
Radix sort
Known as:
Radix (disambiguation)
, RadixSort
, Radix sorting
Expand
In computer science, radix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
48 relations
American flag sort
Bitonic sorter
Breadth-first search
Bubble sort
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Pharmacological effects and chemical components of Radix Glehniae: research advances
Yu Teng-fei
2013
Corpus ID: 88341144
Germplasm of Radix Glehniae derived from Glehnia littoralis is rich in resources,complex in chemical compositions,and has obvious…
Expand
2011
2011
Introduction to GPU Radix Sort
T. Harada
,
Lee W. Howes
2011
Corpus ID: 5964560
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…
Expand
Highly Cited
2000
Highly Cited
2000
Partitioned Parallel Radix Sort
Shindong Lee
,
Minsoo Jeon
,
Dongseung Kim
,
A. Sohn
J. Parallel Distributed Comput.
2000
Corpus ID: 598847
Load balanced parallel radix sort solved the load imbalance problem present in parallel radix sort. Redistributing the keys in…
Expand
1999
1999
Communication conscious radix sort
Daniel Jiménez-González
,
J. Larriba-Pey
,
J. Navarro
International Conference on Supercomputing
1999
Corpus ID: 12006960
The exploitation of data locality in parallel computers is paramount to reduce the memory traffic and communication among…
Expand
1997
1997
Fast Parallel Radix Sort Using a Reconfigurable Mesh
Ju-wook Jang
,
Kyung-Geun Lee
International journal of high speed computing
1997
Corpus ID: 768366
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…
Expand
1996
1996
Fast deterministic sorting on large parallel machines
T. Dachraoui
,
L. Narayanan
IEEE Symposium on Parallel and Distributed…
1996
Corpus ID: 18455619
Many sorting algorithms that perform well on uniformly distributed data suffer significant performance degradation on non-random…
Expand
1993
1993
Towards optimal parallel radix sorting
Ramachandran Vaidyanathan
,
C. Hartmann
,
P. Varshney
[] Proceedings Seventh International Parallel…
1993
Corpus ID: 46625238
The authors propose a radix sorting algorithm for n m-bit numbers (where m= Omega (log n) and polynomially upper bounded in n…
Expand
1991
1991
Efficient Bitonic Sorting of Large Arrays on the MasPar MP-1
J. Prins
1991
Corpus ID: 17138000
The problem of sorting a collection of values on a mesh-connected distributed-memory SIMD computer using variants of Batcher's…
Expand
1990
1990
Efficient Histogramming on Hypercube SIMD Machines
Wei-Ming Lin
,
V. Prasanna
Computer Vision Graphics and Image Processing
1990
Corpus ID: 29375429
1966
1966
Internal Sorting by Radix Plus Sifting
Donald
,
I~v Aclaren
JACM
1966
Corpus ID: 16647848
A method is proposed for internal sorting which has the property that the expected time required per record, to sort n records…
Expand
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)
ACCEPT & CONTINUE