James H. Hester

According to our database, James H. Hester authored at least 4 papers between 1985 and 1988.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1988

Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities.

James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore

J. Algorithms, 1988

1987

Self-Organizing Search Lists Using Probabilistic Back-Pointers.

James H. Hester, Daniel S. Hirschberg

Commun. ACM, 1987

1986

Faster Construction of Optimal Binary Split Trees.

James H. Hester, Daniel S. Hirschberg, S.-H. H. Huang, C. K. Wong

J. Algorithms, 1986

1985

Self-Organizing Linear Search.

James H. Hester, Daniel S. Hirschberg

ACM Comput. Surv., 1985