Sorting In-Place with a Worst Case Complexity of n log n-1.3n + O(logn) Comparisons and epsilon n log n + O(1) Transports

Practical in-place mergesort

Nordic Journal of Computing

On the Performance of WEAK-HEAPSORT

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science

Pushing the Limits in Sequential Sorting

WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering

Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons

Journal of Experimental Algorithmics (JEA)

An in-place sorting with O(nlog n) comparisons and O(n) moves

Journal of the ACM (JACM)

In-place sorting

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science