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
Hilfe
Suche: Author="Du, D.-Z."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximations for a bottleneck Steiner tree problem
L. Wang
,
D.-Z. Du
Algorithmica
32
(4), 2002, pp. 554-561
Placment of data replicas for optimal data availability in ring networks
X.-D. Hu
,
X.-H. Jia
,
D.-Z. Du
,
D.-Y. Li
,
H.-J. Huang
Journal Parallel Distributed Computing
61
(10), 2001, pp. 1412-1424
Grade of service Steiner minimum trees in the Euclidean plane
G. Xue
,
G.-H. Lin
,
D.-Z. Du
Algorithmica
31
(4), 2001, pp. 479-500
An
O(n \log n)
average time algorithm for computing the shortest network under a given toplogy
G. Xue
,
D.-Z. Du
Algorithmica
23
(4), 1999, pp. 354-362
An
O(n\log n)
-average-time algorithm for shortest network under a given topology
Guoliang Xue
,
D.-Z. Du
Lecture Notes in Computer Science
1090
, 1996, pp. 11-20
Modifications of competitive group testing
D.-Z. Du
,
G.-L. Xue
,
S.-Z. Sun
,
S.-W. Cheng
SIAM Journal on Computing
23
(1), 1994, February, pp. 82-96
Connectivity of consecutive-
d
digraphs
D.-Z. Du
,
D.F. Hsu
,
G.W. Peck
Discrete Applied Mathematics
37/38
, 1992, pp. 169-177
A proof of the Gilbert-Pollak conjecture on the Steiner Ratio
D.-Z. Du
,
F.K. Hwang
Algorithmica
7
, 1992, pp. 121-135
A combinatorial problem related to distributed loop networks
D.-Z. Du
,
D.F. Hsu
,
Qiao Li
,
Junming Xu
Networks
20
(2), 1990, pp. 173-180
An approach for proving lower bounds: Solution of Gilbert-Pollak's conjecture on Steiner ratio
D.-Z. Du
,
F.K. Hwang
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 76-85
On polynomial and generalized complexity cores
R.V. Book
,
D.-Z. Du
,
D. Russo
Proceedings of the 3rd Annual Conference on Structure in Complexity Theory, CSCT'88 (Georgetown University, Washington D.C., June 14-17 1988)
, 1988, pp. 236-250
A note on one-way functions and polynomial-time isomorphisms
K.-I. Ko
,
T.J. Long
,
D.-Z. Du
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 295-303
One one-way functions and polynomial-time isomorphisms
Ker-I Ko
,
T.J. Long
,
D.-Z. Du
Theoretical Computer Science
47
(3), 1986, pp. 263-276