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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
The problem addressed in this paper is that we want to sort an array a [] of n floating point numbers conforming to the IEEE 754… 
2018
2018
In this article, Describe about an integer sorting algorithm that is better than radix sort and more general than counting sort… 
2014
2014
Efficient manipulation of sparse multidimensional arrays, or tensors, is of interest because their decompositions have… 
2004
2004
This paper considers integer sorting on a RAM. We show that adaptive sorting of a sequence with qn inversions is asymptotically… 
2003
2003
Hardware performance counters are available on most modern microprocessors. These counters are implemented as a small set of… 
2000
2000
  • M. BednaraO. BeyerJ. TeichT. R. Wanka
  • 2000
  • Corpus ID: 2526044
Sorting long sequences of keys is a problem that occurs in many different applications. For embedded systems, a uniprocessor… 
1996
1996
Abstract. In this paper a general technique for reducing processors in simulation without any increase in time is described. This… 
Review
1995
Review
1995
A list of technical reports, including some abstracts and copies of some full reports may be found at: TR-CS-97-05 Beat Fischer… 
1993
1993
Two new parallel integer sorting algorithms, queue-sort and barrel-sort, are presented and analyzed in detail. These algorithms… 
1990
1990
The problem of sorting n integers from a restricted range (1..m), where m is superpolynomial in n, is considered. An o(n log n…