Sorting in-place with a worst case complexity of n log n − 1.3n + O(log n) comparisons and ε n log n + O(1) transports (1992)

by K Reinhardt
Venue:In Proc. Internat. Symp. Algorithms and Comput., volume 650 of Lect. Notes Comput. Sci