Skip to search formSkip to main contentSkip to account menu

Integer sorting

In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by numeric keys, each of which is an integer… 
Wikipedia (opens in a new tab)

Related topics

Related topics

45 relations
AlgorithmB-treeBenchmark (computing)Binary heap

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Generating Fine-Grain Multithreaded Applications Using a Multigrain Approach
The recent evolution in hardware landscape, aimed at producing high-performance computing systems capable of reaching extreme… 
2005
2005
Linear time algorithms for the ring loading problem with demand splitting
2004
2004
On Adaptive Integer Sorting
This paper considers integer sorting on a RAM. We show that adaptive sorting of a sequence with qn inversions is asymptotically… 
2000
2000
Fast Integer Sorting in Linear Space
We present a fast deterministic algorithm for integer sorting in linear space. Our algorithm sorts n integers in linear space in… 
1998
1998
Improved Bounds for Integer Sorting in the EREW PRAM Model
A new simple method of exploiting nonstandard word length in the nonconservative RAM and PRAM models is considered. As a result… 
1997
1997
Integer sorting algorithms for coarse-grained parallel machines
  • K. AlsabtiS. Ranka
  • Proceedings Fourth International Conference on…
  • 1997
  • Corpus ID: 1175844
Integer sorting is a subclass of the sorting problem where the elements have integer values and the largest element is… 
1995
1995
Conservative Algorithms for Parallel and Sequential Integer Sorting
We present a conservative CRCW parallel algorithm for integer sorting. This algorithm sorts n integers from {0, 1, ..., m−1} in… 
Review
1995
Review
1995
Parallel integer sorting
A list of technical reports, including some abstracts and copies of some full reports may be found at: TR-CS-97-05 Beat Fischer… 
1992
1992
Sorting on PRAMs with Reconfigurable Buses
1992
1992
Integer sorting in O(1) time on an n*n reconfigurable mesh
A constant-time integer sorting algorithm on a reconfigurable mesh is presented. More specifically, a sequence of n integers can… 
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)