![]() |
| 1987 | ||
|---|---|---|
| 6 | M. van der Nat: Expected Time Complexity of a New Class of Distributive Partitioning Sort Algorithms. Angewandte Informatik 29(12): 533-536 (1987) | |
| 1986 | ||
| 5 | M. van der Nat, Alex A. Verrijn-Stuart: Analysing a Class of Distributive Partitioning Sort Algorithms. Sci. Comput. Program. 7(1): 23-33 (1986) | |
| 1983 | ||
| 4 | M. van der Nat: Can Integers be Sorted in Linear Worst Case Time? Angewandte Informatik 25(11): 499-500 (1983) | |
| 1980 | ||
| 3 | M. van der Nat: A Fast Sorting Algorithm, a Hybrid of Distributive and Merge Sorting. Inf. Process. Lett. 10(3): 163-167 (1980) | |
| 1979 | ||
| 2 | M. van der Nat: On Interpolation Search. Commun. ACM 22(12): 681 (1979) | |
| 1 | M. van der Nat: Binary Merging by Partitioning. Inf. Process. Lett. 8(2): 72-75 (1979) | |
| 1 | Alex A. Verrijn-Stuart | [5] |