\bib{1993/wegener}
\yr 1993
\by Ingo Wegener
\paper Bottom-up-heapsort, a new variant of heapsort, beating, on average, quicksort (if $n$ is not very small)
\jour Theoretical Computer Science
\issn 0304--3975
\vol 118
\pages 81--98
\endref