| |
| 1988 | ||
|---|---|---|
| 4 | James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore: Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. J. Algorithms 9(2): 245-253 (1988) | |
| 1987 | ||
| 3 | James H. Hester, Daniel S. Hirschberg: Self-Organizing Search Lists Using Probabilistic Back-Pointers. Commun. ACM 30(12): 1074-1079 (1987) | |
| 1986 | ||
| 2 | James H. Hester, Daniel S. Hirschberg, S.-H. H. Huang, C. K. Wong: Faster Construction of Optimal Binary Split Trees. J. Algorithms 7(3): 412-424 (1986) | |
| 1985 | ||
| 1 | James H. Hester, Daniel S. Hirschberg: Self-Organizing Linear Search. ACM Comput. Surv. 17(3): 295-311 (1985) | |
| 1 | Daniel S. Hirschberg | [1] [2] [3] [4] |
| 2 | S.-H. H. Huang | [2] |
| 3 | Lawrence L. Larmore | [4] |
| 4 | Chak-Kuen Wong (C. K. Wong) | [2] |