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

.

##
###
Improved Fast Integer Sorting in Linear Space

2001
*
Information and Computation
*

We present a fast deterministic algorithm for integer sorting in linear space. Our algorithm sorts n integers in the range {0, 1, 2, . . . , m − 1} in linear space in O(n log log n log log log n) time. When log m ≥ log 2+ n, > 0, we can further achieve O(n log log n) time. This improves the O(n(log log n) 2 ) time bound given in M. Thorup (1998) in "Proc. 1998 ACM-SIAM Symp. on Discrete Algorithms (SODA'98)," pp. 550-555). This result is obtained by combining our new technique with that of

doi:10.1006/inco.2001.3053
fatcat:une6vw3ur5hadlcirwzegr242y