Hannu Erkiö

	1984
8		Hannu Erkiö: The Worst Case Permutation for Median-of-Three Quicksort. Comput. J. 27(3): 276-277 (1984)
7		Timo O. Alanko, Hannu Erkiö, Ilkka J. Haikala: Virtual Memory Behavior of Some Sorting Algorithms. IEEE Trans. Software Eng. 10(4): 422-431 (1984)
	1983
6		Hannu Erkiö, Risto Terkki: Binary search with variable-length keys within an index page. Inf. Syst. 8(2): 137-140 (1983)
	1981
5		Hannu Erkiö: Speeding Sort Algorithms by Special Instructions. BIT 21(1): 2-19 (1981)
	1980
4		Hannu Erkiö: A Heuristic Approximation of the Worst Case of Shellsort. BIT 20(2): 130-136 (1980)
3		Hannu Erkiö: Internal Merge Sorting with Delayed Selection. Inf. Process. Lett. 11(3): 137-140 (1980)
	1978
2		Eero Peltola, Hannu Erkiö: Insertion Merge Sorting. Inf. Process. Lett. 7(2): 92-99 (1978)
	1977
1		Eero Peltola, Hannu Erkiö: Balanced Internal Merge Sorting. International Computing Symposium 1977: 367-371

Coauthor Index

1	Timo O. Alanko	[7]
2	Ilkka J. Haikala	[7]
3	Eero Peltola	[1] [2]
4	Risto Terkki	[6]

Colors in the list of coauthors