2009 |
25 | EE | Nikhil Bansal,
Ho-Leung Chan:
Weighted flow time does not admit O(1)-competitive algorithms.
SODA 2009: 1238-1244 |
24 | EE | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Speed scaling with an arbitrary power function.
SODA 2009: 693-701 |
23 | EE | Ho-Leung Chan,
Jeff Edmonds,
Tak Wah Lam,
Lap-Kei Lee,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy.
STACS 2009: 255-264 |
22 | EE | Ho-Leung Chan,
Jeff Edmonds,
Tak Wah Lam,
Lap-Kei Lee,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy
CoRR abs/0902.1260: (2009) |
2008 |
21 | EE | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Speed Scaling with a Solar Cell.
AAIM 2008: 15-26 |
20 | EE | Nikhil Bansal,
Ho-Leung Chan,
Tak Wah Lam,
Lap-Kei Lee:
Scheduling for Speed Bounded Processors.
ICALP (1) 2008: 409-420 |
19 | EE | Nikhil Bansal,
David P. Bunde,
Ho-Leung Chan,
Kirk Pruhs:
Average Rate Speed Scaling.
LATIN 2008: 240-251 |
18 | EE | Ho-Leung Chan,
Tak Wah Lam,
Wing-Kin Sung,
Prudence W. H. Wong,
Siu-Ming Yiu:
Non-overlapping Common Substrings Allowing Mutations.
Mathematics in Computer Science 1(4): 543-555 (2008) |
17 | EE | Ho-Leung Chan,
Tak Wah Lam,
Kin-Shing Liu:
Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling.
SIAM J. Comput. 37(5): 1595-1612 (2008) |
2007 |
16 | EE | Ho-Leung Chan,
Tak Wah Lam,
Prudence W. H. Wong:
Efficiency of Data Distribution in BitTorrent-Like Systems.
AAIM 2007: 378-388 |
15 | EE | Nikhil Bansal,
Ho-Leung Chan,
Rohit Khandekar,
Kirk Pruhs,
Clifford Stein,
Baruch Schieber:
Non-Preemptive Min-Sum Scheduling with Resource Augmentation.
FOCS 2007: 614-624 |
14 | EE | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling.
ICALP 2007: 28-39 |
13 | EE | Ho-Leung Chan,
Wun-Tat Chan,
Tak Wah Lam,
Lap-Kei Lee,
Kin-Sum Mak,
Prudence W. H. Wong:
Energy efficient online deadline scheduling.
SODA 2007: 795-804 |
12 | EE | Ho-Leung Chan,
Wing-Kai Hon,
Tak Wah Lam,
Kunihiko Sadakane:
Compressed indexes for dynamic text collections.
ACM Transactions on Algorithms 3(2): (2007) |
2006 |
11 | EE | Ho-Leung Chan,
Tak Wah Lam,
Wing-Kin Sung,
Siu-Lung Tam,
Swee-Seong Wong:
A Linear Size Index for Approximate Pattern Matching.
CPM 2006: 49-59 |
10 | EE | Ho-Leung Chan,
Tak Wah Lam,
Wing-Kin Sung,
Siu-Lung Tam,
Swee-Seong Wong:
Compressed Indexes for Approximate String Matching.
ESA 2006: 208-219 |
9 | EE | Ho-Leung Chan,
Tak Wah Lam,
Kin-Shing Liu:
Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling.
SODA 2006: 334-343 |
8 | EE | Ho-Leung Chan,
Jesper Jansson,
Tak Wah Lam,
Siu-Ming Yiu:
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix.
J. Bioinformatics and Computational Biology 4(4): 807-832 (2006) |
2005 |
7 | EE | Ho-Leung Chan,
Jesper Jansson,
Tak Wah Lam,
Siu-Ming Yiu:
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix.
MFCS 2005: 224-235 |
6 | EE | Ho-Leung Chan,
Wing-Kai Hon,
Tak Wah Lam,
Kunihiko Sadakane:
Dynamic dictionary matching and compressed suffix trees.
SODA 2005: 13-22 |
5 | EE | Ho-Leung Chan,
Tak Wah Lam,
Wing-Kin Sung,
Prudence W. H. Wong,
Siu-Ming Yiu,
X. Fan:
The mutated subsequence problem and locating conserved genes.
Bioinformatics 21(10): 2271-2278 (2005) |
4 | EE | Ho-Leung Chan,
Tak Wah Lam,
Kar-Keung To:
Nonmigratory Online Deadline Scheduling on Multiprocessors.
SIAM J. Comput. 34(3): 669-682 (2005) |
2004 |
3 | EE | Ho-Leung Chan,
Tak Wah Lam,
Wing-Kin Sung,
Prudence W. H. Wong,
Siu-Ming Yiu:
A Mutation-Sensitive Approach for Locating Conserved Gene Pairs between Related Species.
BIBE 2004: 545-552 |
2 | EE | Ho-Leung Chan,
Wing-Kai Hon,
Tak Wah Lam:
Compressed Index for a Dynamic Collection of Texts.
CPM 2004: 445-456 |
1 | EE | Ho-Leung Chan,
Tak Wah Lam,
Kar-Keung To:
Non-migratory online deadline scheduling on multiprocessors.
SODA 2004: 970-979 |