Self-Organizing Linear Search. - James H. Hester; Daniel S. Hirschberg (ACM Comput. Surv., 1985)

Faster Construction of Optimal Binary Split Trees. - James H. Hester; Daniel S. Hirschberg; S.-H. H. Huang; C. K. Wong (J. Algorithms, 1986)

Self-Organizing Search Lists Using Probabilistic Back-Pointers. - James H. Hester; Daniel S. Hirschberg (Commun. ACM, 1987)

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)