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.
2012
2012
Predicting distributed application performance is a constant challenge to researchers, with an increased difficulty when… 
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
2004
Highly Cited
2004
  • Yijie Han
  • 2004
  • Corpus ID: 19796291
Highly Cited
2002
Highly Cited
2002
We present a randomized algorithm sorting n integers in O(n/spl radic/(log log n)) expected time and linear space. This improves… 
2002
2002
We present a randomized algorithm sorting integers in expected time and linear space. This improves the previous bound by… 
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
Abstract The following problems are shown to be solvable in O(log* n) time with optimal speedup with high probability on a… 
1989
1989
We present an almost-optimal parallel algorithm for finding triconnected components on a CRCW PRAM. The time complexity of our…