Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations.

Mikkel Thorup Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations. 205-230 2002 42 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2002.1211 db/journals/jal/jal42.html#Thorup02