Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Hirschberg, D.S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Systolic self-organizing lists under transpose
L.M. Stauffer
,
D.S. Hirschberg
IEEE Transactions on Parallel and Distributed Systems
6
(1), 1995, pp. 102-105
PRAM algorithms for static dictionary compression
L.M. Stauffer
,
D.S. Hirschberg
Proceedings of the 8th International Parallel Processing Symposium, IPPS'94 (CancĂșn, Mexico, April 26-29, 1994)
, 1994, pp. 344-348
A bounded-space tree traversal algorithm
D.S. Hirschberg
,
S.S. Seiden
Information Processing Letters
47
(4), 1993, pp. 215-219
The traveler's problem
D.S. Hirschberg
,
L.L. Larmore
Journal of Algorithms
13
, 1992, pp. 148-160
A fast algorithm for optimal length-limited Huffman codes
L.L. Larmore
,
D.S. Hirschberg
Journal of the ACM
37
(3), 1990, July, pp. 464-473
The set-set LCS Problem
D.S. Hirschberg
,
L.L. Larmore
Algorithmica
4
, 1989, pp. 503-510
Construction of optimal binary split trees in the presence of bounded access probabilities
J.H. Hester
,
D.S. Hirschberg
,
L.L. Larmore
Journal of Algorithms
9
(2), 1988, June, pp. 245-253
The set LCS problem
D.S. Hirschberg
,
L.L. Larmore
Algorithmica
2
(1), 1987, pp. 91-95
New applications of failure functions
D.S. Hirschberg
,
L.L. Larmore
Journal of the ACM
34
(3), 1987, July, pp. 616-625
The least weight subsequence problem
D.S. Hirschberg
,
L.L. Larmore
SIAM Journal on Computing
16
(4), 1987, August, pp. 628-638
Improved update/query algorithms for the interval valuation problem
D.S. Hirschberg
,
D.J. Volper
Information Processing Letters
24
(5), 1987, March, pp. 307-310
Faster construction of optimal binary split trees
J.H. Hester
,
D.S. Hirschberg
,
S.-H.S. Huang
,
C.K. Wong
Journal of Algorithms
7
(3), 1986, September, pp. 412-424
Average case analysis of marking algorithms
D.S. Hirschberg
,
L.L. Larmore
SIAM Journal on Computing
15
(4), 1986, November, pp. 1069-1074
The least weight subsequence problem
D.S. Hirschberg
,
L.L. Larmore
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 137-143
On the complexity of searching a set of vectors
D.S. Hirschberg
SIAM Journal on Computing
9
(1), 1980, February, pp. 126-129
Computing connected components on parallel computers
D.S. Hirschberg
,
A.K. Chandra
,
D.V. Sarwate
Communications of the ACM
22
, 1979, pp. 461-464
Upper and lower bounds for graph-diameter problems with application to record allocation
D.S. Hirschberg
,
C.K. Wong
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 66-74
Fast parallel sorting algorithms
D.S. Hirschberg
Communications of the ACM
21
(8), 1978, August, pp. 657-661
An information-theoretic lower bound for the longest common subsequence problem
D.S. Hirschberg
Information Processing Letters
7
(1), 1978, January, pp. 40-41
Algorithms for the longest common subsequence problem
D.S. Hirschberg
Journal of the ACM
24
, 1977, pp. 664-675
Bounds on the complexity of the longest common subsequence problem
A.V. Aho
,
D.S. Hirschberg
,
J.D. Ullman
Journal of the ACM
23
(1), 1976, January, pp. 1-12
Approximate algorithms for some generalized knapsack problems
A.K. Chandra
,
D.S. Hirschberg
,
C.K. Wong
Theoretical Computer Science
3
(3), 1976, pp. 293-304
A polynomial-time algorithm for the knapsack problem with two variables
D.S. Hirschberg
,
C.K. Wong
Journal of the ACM
23
, 1976, pp. 147-154
Parallel algorithms for the transitive closure and the connected component problems
D.S. Hirschberg
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, STOC'76 (Hershey, PA, May 3-5, 1976)
, 1976, pp. 55-57