A. Andersson, S. Nilsson and T. Hagerup.
Blasting past fusion trees.
Tech. report, Lund University, 1994.
We present an O(n loglog n) worst-case time algorithm for sorting arbitrary
integers, a significant improvement over the bound achieved by the
fusion tree of Fredman and Willard.