A variant of Heapsort with almost optimal number of comparisons

The External Heapsort

IEEE Transactions on Software Engineering

Fishspear: a priority queue algorithm

Journal of the ACM (JACM)

Practical in-place mergesort

Nordic Journal of Computing

An Improvement on Tree Selection Sort

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments

QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms

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

Achieving range-free localization beyond connectivity

Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems

The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than n log n + 1.1n

Information and Computation

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