Balanced Internal Merge Sorting. - Eero Peltola; Hannu Erkiö (International Computing Symposium, 1977)

Insertion Merge Sorting. - Eero Peltola; Hannu Erkiö (Inf. Process. Lett., 1978)

A Heuristic Approximation of the Worst Case of Shellsort. - Hannu Erkiö (BIT, 1980)

Internal Merge Sorting with Delayed Selection. - Hannu Erkiö (Inf. Process. Lett., 1980)

Speeding Sort Algorithms by Special Instructions. - Hannu Erkiö (BIT, 1981)

Binary search with variable-length keys within an index page. - Hannu Erkiö; Risto Terkki (Inf. Syst., 1983)

The Worst Case Permutation for Median-of-Three Quicksort. - Hannu Erkiö (Comput. J., 1984)

Virtual Memory Behavior of Some Sorting Algorithms. - Timo O. Alanko; Hannu Erkiö; Ilkka J. Haikala (IEEE Trans. Software Eng., 1984)