default search action

combined dblp search
author search
venue search
publication search

ask others

O. J. Murphy

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

1990 – 1999

see FAQ

What is the meaning of the colors in the publication lists?

1991
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/tc/MurphyM91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/MurphyM91
O. J. Murphy, R. L. McCraw:
Designing Storage Efficient Decision Trees. IEEE Trans. Computers 40(3): 315-320 (1991)
1990
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/MurphyS90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/MurphyS90
O. J. Murphy, Stanley M. Selkow:
Finding Nearest Neighbors with Voronoi Tessellations. Inf. Process. Lett. 34(1): 37-41 (1990)

1980 – 1989

see FAQ

What is the meaning of the colors in the publication lists?

1989
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/tcad/LeckyMA89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcad/LeckyMA89
J. E. (Ned) Lecky, O. J. Murphy, Richard Absher:
Graph theoretic algorithms for the PLA folding problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(9): 1014-1021 (1989)
1986
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/MurphyS86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/MurphyS86
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)

Coauthor Index

see FAQ

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.