BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)

Fast priority queues for cached memory

Journal of Experimental Algorithmics (JEA)

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

QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms

CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity

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)

Multiway in-place merging

Theoretical Computer Science

Multiway in-place merging

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory

High-speed high-security signatures

CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems

Policy-based benchmarking of weak heaps and their relatives,

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms

In-place heap construction with optimized comparisons, moves, and cache misses

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Weak heaps engineered

Journal of Discrete Algorithms