Biblio

Export 139 results:
Sort by:
Filters: Author is Lenwood S. Heath  [Clear All Filters]
1991
1990
1989
Fox, E. A., Q. Chen, L. S. Heath, and S. Datta, "A More Cost Effective Algorithm for Finding Perfect Hash Functions", Proceedings of the ACM 1989 Computer Science Conference, Louisville, KY, pp. 114-122, February 1989.
Shaffer, C. A., R. Juvvadi, and L. S. Heath, A Generalized Comparison of Quadtree and Bintree Storage Requirements, , Blacksburg, VA, USA, Virginia Polytechnic Institute & State University, 1989.
Fox, E. A., Q. F. Chen, L. S. Heath, and S. Datta, "A More Cost Effective Algorithm for Finding Minimal Perfect Hash Functions", Seventeenth Annual ACM Computer Science Conference, 1989,, pp. pp. 114-122. , 1989.
1988
Heath, L. S., A. L. Rosenberg, and B. T. Smith, "The Physical Mapping Problem for Parallel Architectures", Journal of the Association for Computing Machinery, vol. 35, pp. pp. 603-634. , 1988.
1987
Heath, L. S., "Embedding Outerplanar Graphs in Small Books", SIAM Journal on Algebraic and Discrete Methods, vol. 8, pp. pp. 198-218. , 1987.
1984