John K. Dixon

According to our database, John K. Dixon authored at least 10 papers between 1969 and 1984.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1984

Freedom descriptions: A way to find figures that approximate given points.

James R. Slagle, John K. Dixon

Pattern Recognit., 1984

1982

Rapid prototyping by means of abstract module specifications written as trace axioms.

John K. Dixon, John McLean, David Lorge Parnas

Proceedings of the workshop on Rapid Prototyping, 1982

1981

MARK I Robot.

John K. Dixon, Susan A. Bouchard, William G. Kennedy, James R. Slagle

Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981

1980

Finding a good figure that approximately passes through given points.

James R. Slagle, John K. Dixon

Pattern Recognit., 1980

1979

Pattern Recognition with Partly Missing Data.

John K. Dixon

IEEE Trans. Syst. Man Cybern., 1979

1973

The Specialization of Programs by Theorem Proving.

Chin-Liang Chang, Richard C. T. Lee, John K. Dixon

SIAM J. Comput., 1973

Z-Resolution: Theorem-Proving with Compiled Axioms.

John K. Dixon

J. ACM, 1973

1972

Short papers.

John K. Dixon

SIGART Newsl., 1972

1970

Experiments with the M & N tree-searching program.

James R. Slagle, John K. Dixon

Commun. ACM, 1970

1969

Experiments With Some Programs That Search Game Trees.

James R. Slagle, John K. Dixon

J. ACM, 1969