![]() | ![]() |
1991 | ||
---|---|---|
4 | O. J. Murphy, R. L. McCraw: Designing Storage Efficient Decision Trees. IEEE Trans. Computers 40(3): 315-320 (1991) | |
1990 | ||
3 | O. J. Murphy, Stanley M. Selkow: Finding Nearest Neighbors with Voronoi Tessellations. Inf. Process. Lett. 34(1): 37-41 (1990) | |
1989 | ||
2 | EE | J. E. (Ned) Lecky, O. J. Murphy, Richard Absher: Graph theoretic algorithms for the PLA folding problem. IEEE Trans. on CAD of Integrated Circuits and Systems 8(9): 1014-1021 (1989) |
1986 | ||
1 | O. J. Murphy, Stanley M. Selkow: The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space. Inf. Process. Lett. 23(4): 215-218 (1986) |
1 | Richard Absher | [2] |
2 | J. E. (Ned) Lecky | [2] |
3 | R. L. McCraw | [4] |
4 | Stanley M. Selkow | [1] [3] |