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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

Predicting distributed application performance is a constant challenge to researchers, with an increased difficulty when…

2005

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

We present a randomized algorithm sorting n integers in O(n/spl radic/(log log n)) expected time and linear space. This improves…

2002

We present a randomized algorithm sorting integers in expected time and linear space. This improves the previous bound by…

2000

We present a fast deterministic algorithm for integer sorting in linear space. Our algorithm sorts n integers in linear space in…

1996

We present deterministic algorithms for integer sorting and on-line packet routing on arrays with reconfigurable optical buses…

1995

We present a conservative CRCW parallel algorithm for integer sorting. This algorithm sorts n integers from {0, 1, ..., m−1} in…

1995

We show that simulating a step of a FETCH&ADD PRAM model on an EREW PRAM model can be made as efficient as integer sorting. In…

1992