The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space. - O. J. Murphy; Stanley M. Selkow (Inf. Process. Lett., 1986)

Graph theoretic algorithms for the PLA folding problem. - J. E. (Ned) Lecky; O. J. Murphy; Richard Absher (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1989)

Finding Nearest Neighbors with Voronoi Tessellations. - O. J. Murphy; Stanley M. Selkow (Inf. Process. Lett., 1990)

Designing Storage Efficient Decision Trees. - O. J. Murphy; R. L. McCraw (IEEE Trans. Computers, 1991)