#
Owen J. Murphy

##
Publications

###

"Edge Density and the Independence Ratio in Triangle-Free Cubic Graphs,"
to appear in * Discrete Mathematics*, (J. Griggs, co-author).

"Computing Nearest Neighbor Pattern Classification Perceptrons,"
to appear in *Information Science*, (B. Brooks and T. Kite, co-authors).

"Computing Independent Sets in Graphs with Large Girth,"
* Discrete Applied Mathematics*, Vol 35, pp 167-170, 1992.

"Entropy and Information Measures in Combinatorial Optimization,"
* Proceedings of the 1992 Symposium on Applied Computing*, March 1992.
(A. Tehranipour, co-author).

"An Information Theoretic Design and Training Algorithm for Neural
Networks," * IEEE Transactions on Circuits and Systems* Vol 38,
pp 1542-1547, 1991.

"Designing Storage Efficient Decision Trees,"
* IEEE Transactions on Computers*, Vol 40, pp 315-320, 1991 (R.M. McCraw, co-author).

"Lower Bounds on the Stability Number of Graphs Computed in Terms of Degrees,"
* Discrete Mathematics*, Vol 90, pp 207-211, 1991.

"A Parallel Algorithm for the Independent Set Problem", in * Proceedings
of the 1991 Symposium on Applied Computing*, IEEE Computer Science Press, 1991
(A. Tehranipour, co-author).

"Nearest Neighbor Pattern Classification Perceptrons",
* Proceedings of the IEEE*, Vol 78, pp 595-598, 1990.
Also in * Foundations of Neural Networks*, Clifford Lau, editor,
IEEE Press, 1991.

"A Unifying Framework for Trie Design Heuristics",
* Information Processing Letters*, Vol 34, pp 243-249, 1990.

"Finding Nearest Neighbors with Voronoi Tessellations,"
* Information Processing Letters*, Vol 34 (1), pp 37-41, (S.M. Selkow, co-author).

"Graph Theoretic Algorithms for the PLA Folding Problem,"
* IEEE Transactions on Computer-Aided Design*, Vol 8 1989, pp 1014-1021, (J.E. Lecky, R.G. Absher co-authors).

"The Efficiency of Using k-d Trees for Finding Nearest Neighbors in
Discrete Space," * Information Processing Letters*,
23 (4), pp 215-218, (S.M. Selkow, co-author).