 | 2001 |
| 18 |  | Vladimir A. Kuznetsov,
Gary D. Knott:
A Prediction Method for Multi-Class Systems Based on Limited Data.
CBMS 2001: 279-284 |
| 17 |  | Gerhard Opfer,
Gary D. Knott:
Interpolating Cubic Splines.
Journal of Approximation Theory 112(2): 319-321 (2001) |
| 2000 |
| 16 |  | Masaaki Yoshigi,
Gary D. Knott,
Bradley B. Keller:
Lumped parameter estimation for the embryonic chick vascular system: a time-domain approach using MLAB.
Computer Methods and Programs in Biomedicine 63(1): 29-41 (2000) |
| 1994 |
| 15 |  | Jiang-Hsing Chu,
Gary D. Knott:
An Analysis of Spiral Hashing.
Comput. J. 37(8): 715-719 (1994) |
| 1993 |
| 14 |  | Jiang-Hsing Chu,
Gary D. Knott:
A New Method for Computing Page-Fault Rates.
SIAM J. Comput. 22(6): 1319-1330 (1993) |
| 1989 |
| 13 |  | Avraham Margalit,
Gary D. Knott:
An algorithm for computing the union, intersection or difference of two polygons.
Computers & Graphics 13(2): 167-183 (1989) |
| 12 |  | Jiang-Hsing Chu,
Gary D. Knott:
An Analysis of B-trees and their Variants.
Inf. Syst. 14(5): 359-370 (1989) |
| 11 |  | Gary D. Knott,
Pilar de la Torre:
Hash Table Collision Resolution with Direct Chaining.
J. Algorithms 10(1): 20-34 (1989) |
| 1987 |
| 10 |  | Gary D. Knott:
Computing polygon fill-lines.
Computers & Graphics 11(1): 21-25 (1987) |
| 1984 |
| 9 |  | Gary D. Knott:
Direct-Chaining with Coalescing Lists.
J. Algorithms 5(1): 7-21 (1984) |
| 1982 |
| 8 |  | Gary D. Knott:
Fixed-Bucket Binary Storage Trees.
J. Algorithms 3(3): 276-287 (1982) |
| 1981 |
| 7 |  | Gary D. Knott:
Procedures for Managing Extendible Array Files.
Softw., Pract. Exper. 11(1): 63-84 (1981) |
| 1977 |
| 6 |  | Gary D. Knott:
A Numbering System for Binary Trees.
Commun. ACM 20(2): 113-115 (1977) |
| 1976 |
| 5 |  | Gary D. Knott:
A Numbering System for Permutations of Combinations.
Commun. ACM 19(6): 355-356 (1976) |
| 1975 |
| 4 |  | Gary D. Knott:
Hashing Functions.
Comput. J. 18(3): 265-278 (1975) |
| 1974 |
| 3 |  | Gary D. Knott:
A Numbering Systems for Combinations.
Commun. ACM 17(1): 45-46 (1974) |
| 1971 |
| 2 |  | Gary D. Knott:
Expandable Open Addressing Hash Table Storage and Retrieval.
SIGFIDET Workshop 1971: 187-206 |
| 1 |  | Gary D. Knott:
A Balanced Tree Storage and Retrieval Algorithm.
SIGIR 1971: 175-196 |