Experiments With Some Programs That Search Game Trees. - James R. Slagle; John K. Dixon (J. ACM, 1969)

Experiments with the M & N tree-searching program. - James R. Slagle; John K. Dixon (Commun. ACM, 1970)

Short papers. - John K. Dixon (SIGART Newsl., 1972)

Z-Resolution: Theorem-Proving with Compiled Axioms. - John K. Dixon (J. ACM, 1973)

The Specialization of Programs by Theorem Proving. - Chin-Liang Chang; Richard C. T. Lee; John K. Dixon (SIAM J. Comput., 1973)

Pattern Recognition with Partly Missing Data. - John K. Dixon (IEEE Trans. Syst. Man Cybern., 1979)

Finding a good figure that approximately passes through given points. - James R. Slagle; John K. Dixon (Pattern Recognit., 1980)

MARK I Robot. - John K. Dixon; Susan A. Bouchard; William G. Kennedy; James R. Slagle (IJCAI, 1981)

Rapid prototyping by means of abstract module specifications written as trace axioms. - John K. Dixon; John McLean; David Lorge Parnas (Rapid Prototyping, 1982)

Freedom descriptions: A way to find figures that approximate given points. - James R. Slagle; John K. Dixon (Pattern Recognit., 1984)