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="Chan, Wun-Tat"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linear-time haplotype inference on pedigrees without recombinations and mating loops
Mee Yee Chan
,
Wun-Tat Chan
,
Francis Y.L. Chin
,
Stanley P.Y. Fung
,
Ming-Yang Kao
SIAM Journal on Computing
38
(6), 2009, pp. 2179-2197
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
Wun-Tat Chan
,
Tak-Wah Lam
,
Kin-Shing Liu
,
Prudence W.H. Wong
Theoretical Computer Science
359
(1-3), 2006, pp. 430-439
On dynamic bin packing: An improved lower bound and resource augmentation analysis
Wun-Tat Chan
,
Prudence W.H. Wong
,
Fencol C.C. Yung
Lecture Notes in Computer Science
4112
, 2006, pp. 309-319
Improved on-line broadcast scheduling with deadlines
Feifeng Zheng
,
Stanley P.Y. Fung
,
Wun-Tat Chan
,
Francis Y.L. Chin
,
Chung Keung Poon
,
Prudence W.H. Wong
Lecture Notes in Computer Science
4112
, 2006, pp. 320-329
Off-line algorithms for minimizing total flow time in broadcast scheduling
Wun-Tat Chan
,
Francis Y.L. Chin
,
Yong Zhang
,
Hong Zhu
,
Hong Shen
,
Prudence W.H. Wong
Lecture Notes in Computer Science
3595
, 2005, pp. 318-328
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
Wun-Tat Chan
,
Tak-Wah Lam
,
Kin-Shing Liu
,
Prudence W.H. Wong
Lecture Notes in Computer Science
3618
, 2005, pp. 236-247
On-line stream merging with max span and min coverage
Wun-Tat Chan
,
Tak-Wah Lam
,
Hing-Fung Ting
,
Prudence W.H. Wong
Theory of Computing Systems
38
(4), 2005, pp. 461-479
Dynamic bin packing of unit fractions items
Wun-Tat Chan
,
Tak-Wah Lam
,
Prudence W.H. Wong
Lecture Notes in Computer Science
3580
, 2005, pp. 614-626
Efficient algorithms for finding a longest common increasing subsequence
Wun-Tat Chan
,
Yong Zhang
,
Stanley P.Y. Fung
,
Deshi Ye
,
Hong Zhu
Lecture Notes in Computer Science
3827
, 2005, pp. 665-674
New results on on-demand broadcasting with deadline via job scheduling with cancellation
Wun-Tat Chan
,
Tak-Wah Lam
,
Hing-Fung Ting
,
Prudence W.H. Wong
Lecture Notes in Computer Science
3106
, 2004, pp. 210-218
On-line windows scheduling of temporary items
Wun-Tat Chan
,
Prudence W.H. Wong
Lecture Notes in Computer Science
3341
, 2004, pp. 259-270
Escaping a grid by edge-disjoint paths
Wun-Tat Chan
,
Francis Y.L. Chin
,
Hing-Fung Ting
Algorithmica
36
(4), 2003, pp. 343-359
On-line stream merging, max span, and min coverage
Wun-Tat Chan
,
Tak-Wah Lam
,
Hing-Fung Ting
,
Prudence W.H. Wong
Lecture Notes in Computer Science
2653
, 2003, pp. 70-82
On-line straeam merging in a general setting
Wun-Tat Chan
,
Tak-Wah Lam
,
Hing-Fung Ting
,
Prudence W.H. Wong
Theoretical Computer Science
296
(1), 2003, pp. 27-46
Competitive analysis of on-line stream merging algorithms
Wun-Tat Chan
,
Tak-Wah Lam
,
Hing-Fung Ting
,
Prudence W.H. Wong
Lecture Notes in Computer Science
2420
, 2002, pp. 188-200
A unified analysis of hot video schedulers
Wun-Tat Chan
,
Tak-Wah Lam
,
Hing-Fung Ting
,
Wai-Ha Wong
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 179-188
Improved on-line stream merging: From a restricted to a general setting
Wun-Tat Chan
,
Tak-Wah Lam
,
Hing-Fung Ting
,
Wai-Ha Wong
Lecture Notes in Computer Science
2108
, 2001, pp. 432-442
Efficient algorithms for finding the maximum number of disjoint paths in grids
Wun-Tat Chan
,
Francis Y.L. Chin
Journal of Algorithms
34
(2), 2000, pp. 337-369
A faster algorithm for finding disjoint paths in grids
Wun-Tat Chan
,
Francis Y.L. Chin
,
Hing-Fung Ting
Lecture Notes in Computer Science
1741
, 1999, pp. 393-402
Algorithms for finding optimal disjoint paths around a rectangle
Wun-Tat Chan
,
Francis Y.L. Chin
Lecture Notes in Computer Science
1350
, 1997, pp. 314-323
Efficient algorithms for finding disjoint paths in grids
Wun-Tat Chan
,
Francis Y.L. Chin
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 454-463