O. J. Murphy

According to our database, O. J. Murphy authored at least 4 papers between 1986 and 1991.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

1991

Designing Storage Efficient Decision Trees.

O. J. Murphy, R. L. McCraw

IEEE Trans. Computers, 1991

1990

Finding Nearest Neighbors with Voronoi Tessellations.

O. J. Murphy, Stanley M. Selkow

Inf. Process. Lett., 1990

1989

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

1986

The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space.

O. J. Murphy, Stanley M. Selkow

Inf. Process. Lett., 1986