A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Sorting in linear time?

1995
*
Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95
*

We show that a unit-cost RAM with a word length of w bits can sort n integers in the range O. . 2W -1 in O (n log log n) time, for arbitrary w z log n, a significant improvement over the bound of O (n-) achieved by the fusion trees of Fredman and Willard. Provided that w 2 (log n)z+', for some fixed e > 0, the sorting can even be accomplished in linear expected time with a randomized algorithm. Both of our algorithms parallelize without loss on a unitcost PRAM with a word length of w bits. The

doi:10.1145/225058.225173
dblp:conf/stoc/AnderssonHNR95
fatcat:5pl4yf3zi5fq7j5omkeki7kmbi