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="Hwang, F.K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The identification of positive clones in a general inhibitor model
F.K. Hwang
,
F.H. Chang
Journal of Computer and System Sciences
73
(7), 2007, pp. 1090-1094
Wide-sense nonblocking for multi-
\log_d N
networks under various routing strategies
F.H. Chang
,
J.Y. Guo
,
F.K. Hwang
Theoretical Computer Science
352
(1-3), 2006, pp. 232-239
An almost-linear time and linear space algorithm for the longest common subsequence problem
J.Y. Guo
,
F.K. Hwang
Information Processing Letters
94
(3), 2005, pp. 131-135
Strict nonblockingness of reduced shuffle-exchange networks
F.K. Hwang
,
Binwu Zhang
Networks
45
(1), 2005, pp. 4-8
Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies
F.H. Chang
,
J.Y. Guo
,
F.K. Hwang
,
C.K. Lin
Theoretical Computer Science
314
(3), 2004, pp. 375-386
Equivalence of the 1-rate model to the classical model on strictly nonblocking switching networks
W.R. Chen
,
F.K. Hwang
,
Xuding Zhu
SIAM Journal on Discrete Mathematics
17
(3), 2004, pp. 446-452
A survey on multi-loop networks
F.K. Hwang
Theoretical Computer Science
299
(1-3), 2003, pp. 107-121
Some permutation routing algorithms for low-dimensional hypercubes
F.K. Hwang
,
Y.C. Yao
,
B. Dasgupta
Theoretical Computer Science
270
(1-2), 2002, pp. 111-124
Group testing and fault detection for replicated files
F.K. Hwang
,
Wenan Zang
Discrete Applied Mathematics
116
(3), 2002, pp. 231-242
When is individual testing optimal for nonadaptive group testing?
S.H. Huang
,
F.K. Hwang
SIAM Journal on Discrete Mathematics
14
(4), 2001, pp. 540-548
Optimal quantitative group testing on cycles and paths
F.K. Hwang
,
J.S. Lee
Discrete Applied Mathematics
113
(2-3), 2001, pp. 299-302
A complementary survey on double-loop networks
F.K. Hwang
Theoretical Computer Science
263
(1-2), 2001, pp. 211-229
Equivalent nondegenerate L-shapes of double-loop networks
Chiuyuan Chen
,
F.K. Hwang
Networks
36
(2), 2000, pp. 118-125
Sequential construction of a circular consecutive-2 system
F.K. Hwang
,
C.K. Pai
Information Processing Letters
75
(5), 2000, pp. 231-235
Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation
G.W. Richards
,
F.K. Hwang
Networks
33
(4), 1999, pp. 269-291
On multirate rearrangeable Clos networks
D.Z. Du
,
B. Gao
,
F.K. Hwang
,
J.H. Kim
SIAM Journal on Computing
28
(2), 1998, pp. 463-470
Comments on the oblivious routing algorithm of Kaklamanis, Krizanc, and Tsantilas in the hypercube
F.K. Hwang
,
Y.C. Yao
Theory of Computing Systems
31
(1), 1998, pp. 63-66
Optimality of consecutive and nested tree partitions
G.J. Chang
,
F.K. Hwang
Networks
30
(2), 1997, pp. 75-80
On 1-rate wide-sense nonblocking for 3-stage Clos networks
Peter Fishburn
,
F.K. Hwang
,
D.Z. Du
,
B. Gao
Discrete Applied Mathematics
78
(1-3), 1997, pp. 75-87
Wide-sense nonblocking for multirate 3-stage close networks
B. Gao
,
F.K. Hwang
Theoretical Computer Science
182
(1-2), 1997, pp. 171-182
A permutation routing algorithm for double loop networks
F.K. Hwang
,
Tzai-Shunne Lin
,
Rong-Hong Jan
Parallel Processing Letters
7
(3), 1997, pp. 259-265
Detecting corrupted pages in
M
replicated large files
F.K. Hwang
,
Wenan Zang
IEEE Transactions on Parallel and Distributed Systems
8
(12), 1997, pp. 1241-1245
Enumerating nested and consecutive partitions
F.K. Hwang
,
C.L. Mallows
Journal of Combinatorial Theory Series A
70
(2), 1995, pp. 323-333
The time complexity of deterministic broadcast radio networks
F.K. Hwang
Discrete Applied Mathematics
60
, 1995, pp. 219-222
An isomorphic factorization of the complete graph
F.K. Hwang
Journal of Graph Theory
19
(3), 1995, pp. 333-337
Seiten 1
2
3
4
>