Author: Daniel S. Hirschberg

Publications

Co-authors

Debra A. Lelewer

1

J. B. Sinclair

1

Lawrence L. Larmore

1

Productive Colleagues

J. B. Sinclair

1

Lawrence L. Larmore

2

Dilip V. Sarwate

3

Publications

Hirschberg, Daniel S., Lelewer, Debra A. (1990): Efficient Decoding of Prefix Codes. In Communications of the ACM, 33 (4) pp. 449-459.

Hester, James H., Hirschberg, Daniel S. (1987): Self-Organizing Search Lists Using Probabilistic Back-Pointers. In Communications of the ACM, 30 (12) pp. 1074-1079.

Larmore, Lawrence L., Hirschberg, Daniel S. (1985): Efficient Optimal Pagination of Scrolls. In Communications of the ACM, 28 (8) pp. 854-856.

Hirschberg, Daniel S., Sinclair, J. B. (1980): Decentralized Extrema-Finding in Circular Configurations of Processors. In Communications of the ACM, 23 (11) pp. 627-628.

Hirschberg, Daniel S., Chandra, Ashok K., Sarwate, Dilip V. (1979): Computing Connected Components on Parallel Computers. In Communications of the ACM, 22 (8) pp. 461-464.

Hirschberg, Daniel S. (1978): Fast Parallel Sorting Algorithms. In Communications of the ACM, 21 (8) pp. 657-661.

Hirschberg, Daniel S. (1976): An Insertion Technique for One-Sided Height-Balanced Trees. In Communications of the ACM, 19 (8) pp. 471-473.

Hirschberg, Daniel S. (1975): A Linear Space Algorithm for Computing Maximal Common Subsequences. In Communications of the ACM, 18 (6) pp. 341-343.

Hirschberg, Daniel S. (1973): A Class of Dynamic Memory Allocation Algorithms. In Communications of the ACM, 16 (10) pp. 615-618.