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.
2017
2017
Many modern data processing and HPC workloads are heavily memory-latency bound. A tempting proposition to solve this is software… 
2004
2004
This paper considers integer sorting on a RAM. We show that adaptive sorting of a sequence with qn inversions is asymptotically… 
Highly Cited
2002
Highly Cited
2002
  • Yijie Han, M. Thorup
  • The 43rd Annual IEEE Symposium on Foundations of…
  • 2002
  • Corpus ID: 5245628
We present a randomized algorithm sorting n integers in O(n/spl radic/(log log n)) expected time and linear space. This improves… 
Highly Cited
1998
Highly Cited
1998
Previous schemes for sorting on general-purpose parallel machines have had to choose between poor load balancing and irregular… 
1995
1995
We present a conservative CRCW parallel algorithm for integer sorting. This algorithm sorts n integers from {0, 1, ..., m−1} in… 
Highly Cited
1995
Highly Cited
1995
Writing large‐scale parallel and distributed scientific applications that make optimum use of the multiprocessor is a challenging… 
Highly Cited
1992
Highly Cited
1992
We show that <italic>n</italic> integers in the range 1..<italic>n</italic> can be stably sorted on an EREW PRAM using <italic>O… 
Highly Cited
1990
Highly Cited
1990
We address the problem of sorting n integers each in the range {0, ..., m - 1} in parallel on the PRAM model of computation. We… 
1989
1989
We present an almost-optimal parallel algorithm for finding triconnected components on a CRCW PRAM. The time complexity of our… 
Highly Cited
1985
Highly Cited
1985
  • J. Reif
  • 26th Annual Symposium on Foundations of Computer…
  • 1985
  • Corpus ID: 5694693
We assume a parallel RAM model which allows both concurrent writes and concurrent reads of global memory. Our algorithms are…