Daniel S. Hirschberg

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with James H. Hester

> Home > Persons > Daniel S. Hirschberg

Publications

1988
[j26]
- view
  authority control:
- export record
  dblp key:
  - journals/jal/HesterHL88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/HesterHL88
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
[j24]
- view
  authority control:
- export record
  dblp key:
  - journals/cacm/HesterH87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cacm/HesterH87
James H. Hester, Daniel S. Hirschberg:
Self-Organizing Search Lists Using Probabilistic Back-Pointers. Commun. ACM 30(12): 1074-1079 (1987)
1986
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/jal/HesterHHW86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/HesterHHW86
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
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/csur/HesterH85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/csur/HesterH85
James H. Hester, Daniel S. Hirschberg:
Self-Organizing Linear Search. ACM Comput. Surv. 17(3): 295-311 (1985)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.