Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Chan, Wun-Tat
140  Ergebnisse:
Personensuche X
?
1

Linear-Time Haplotype Inference on Pedigrees without Recomb..:

Chan, Mee Yee ; Chan, Wun-Tat ; Chin, Francis Y. L...
SIAM Journal on Computing.  38 (2009)  6 - p. 2179-2197 , 2009
Link: https://doi.org/10.1137/..
 
?
2

Improved on-line broadcast scheduling with deadlines:

Fung, Stanley P. Y. ; Zheng, Feifeng ; Chan, Wun-Tat...
Journal of Scheduling.  11 (2008)  4 - p. 299-308 , 2008
Link: https://doi.org/10.1007/..
 
?
3

On-line scheduling of parallel jobs on two machines:

Chan, Wun-Tat ; Chin, Francis Y.L. ; Ye, Deshi..
Journal of Discrete Algorithms.  6 (2008)  1 - p. 3-10 , 2008
Link: https://doi.org/10.1016/..
 
?
4

Energy efficient online deadline scheduling:

, In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms,
Chan, Ho-Leung ; Chan, Wun-Tat ; Lam, Tak-Wah... - p. 795-804 , 2007
Link: https://dl.acm.org/doi/1..
 
?
5

Online bin packing of fragile objects with application in c..:

Chan, Wun-Tat ; Chin, Francis Y.-L. ; Ye, Deshi..
Journal of Combinatorial Optimization.  14 (2007)  4 - p. 427-435 , 2007
Link: https://doi.org/10.1007/..
 
?
6

Efficient algorithms for finding a longest common increasin..:

Chan, Wun-Tat ; Zhang, Yong ; Fung, Stanley P. Y...
Journal of Combinatorial Optimization.  13 (2006)  3 - p. 277-288 , 2006
Link: https://doi.org/10.1007/..
 
?
7

A dynamic programming approach of finding an optimal broadc..:

Chan, Wun-Tat ; Chin, Francis Y. L. ; Zhang, Yong...
Journal of Combinatorial Optimization.  11 (2006)  2 - p. 177-187 , 2006
Link: https://doi.org/10.1007/..
 
?
8

New resource augmentation analysis of the total stretch of ..:

Chan, Wun-Tat ; Lam, Tak-Wah ; Liu, Kin-Shing.
Theoretical Computer Science.  359 (2006)  1-3 - p. 430-439 , 2006
Link: https://doi.org/10.1016/..
 
?
9

On-line Stream Merging with Max Span and Min Coverage:

Chan, Wun-Tat ; Lam, Tak-Wah ; Ting, Hing-Fung.
Theory of Computing Systems.  38 (2005)  4 - p. 461-479 , 2005
Link: https://doi.org/10.1007/..
 
?
10

On-line stream merging in a general setting:

Chan, Wun-Tat ; Lam, Tak-Wah ; Ting, Hing-Fung.
Theoretical Computer Science.  296 (2003)  1 - p. 27-46 , 2003
Link: https://doi.org/10.1016/..
 
?
11

Escaping a Grid by Edge-Disjoint Paths:

Chan, Wun-Tat ; Chin, Francis Y. L. ; Ting, Hing-Fung
Algorithmica.  36 (2003)  4 - p. 343-359 , 2003
Link: https://doi.org/10.1007/..
 
?
12

A unified analysis of hot video schedulers:

, In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing,
Chan, Wun-Tat ; Lam, Tak-Wah ; Ting, Hing-Fung. - p. 179-188 , 2002
Link: https://dl.acm.org/doi/1..
 
?
13

Escaping a grid by edge-disjoint paths:

, In: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms,
Chan, Wun-Tat ; Chin, Francis Y. L. ; Ting, Hing-Fung - p. 726-734 , 2000
Link: https://dl.acm.org/doi/1..
 
?
14

Efficient Algorithms for Finding the Maximum Number of Disj..:

Chan, Wun-Tat ; Chin, Francis Y.L.
Journal of Algorithms.  34 (2000)  2 - p. 337-369 , 2000
Link: https://doi.org/10.1006/..
 
?
15

Efficient algorithms for finding disjoint paths in grids:

, In: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms,
Chan, Wun-Tat ; Chin, Francis Y. L. - p. 454-463 , 1997
Link: https://dl.acm.org/doi/1..
 
1-15