 | 2012 |
| 48 |  | Ho-Leung Chan,
Tak Wah Lam,
Lap-Kei Lee,
Hing-Fung Ting:
Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window.
Algorithmica 62(3-4): 1088-1111 (2012) |
| 47 |  | Ho-Leung Chan,
Nicole Megow,
René Sitters,
Rob van Stee:
A note on sorting buffers offline.
Theor. Comput. Sci. 423: 11-18 (2012) |
| 2011 |
| 46 |  | Ho-Leung Chan,
Tak Wah Lam,
Lap-Kei Lee,
Jiangwei Pan,
Hing-Fung Ting,
Qin Zhang:
Edit Distance to Monotonicity in Sliding Windows.
ISAAC 2011: 564-573 |
| 45 |  | Ho-Leung Chan,
Tak Wah Lam,
Rongbin Li:
Energy-Efficient Due Date Scheduling.
TAPAS 2011: 69-80 |
| 44 |  | Jianqiao Zhu,
Ho-Leung Chan,
Tak Wah Lam:
Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models.
WAOA 2011: 137-149 |
| 43 |  | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling.
Algorithmica 59(4): 569-582 (2011) |
| 42 |  | Nikhil Bansal,
David P. Bunde,
Ho-Leung Chan,
Kirk Pruhs:
Average Rate Speed Scaling.
Algorithmica 60(4): 877-889 (2011) |
| 41 |  | Ho-Leung Chan,
Jeff Edmonds,
Tak Wah Lam,
Lap-Kei Lee,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy.
Algorithmica 61(3): 507-517 (2011) |
| 40 |  | Hing-Fung Ting,
Lap-Kei Lee,
Ho-Leung Chan,
Tak Wah Lam:
Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window.
Algorithms 4(3): 200-222 (2011) |
| 39 |  | Ho-Leung Chan,
Tak Wah Lam,
Lap-Kei Lee,
Jiangwei Pan,
Hing-Fung Ting,
Qin Zhang:
Edit Distance to Monotonicity in Sliding Windows
CoRR abs/1111.5386: (2011) |
| 38 |  | Ho-Leung Chan,
Tak Wah Lam,
Wing-Kin Sung,
Siu-Lung Tam,
Swee-Seong Wong:
A linear size index for approximate pattern matching.
J. Discrete Algorithms 9(4): 358-364 (2011) |
| 37 |  | Ho-Leung Chan,
Jeff Edmonds,
Kirk Pruhs:
Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor.
Theory Comput. Syst. 49(4): 817-833 (2011) |
| 2010 |
| 36 |  | Vincenzo Bonifaci,
Ho-Leung Chan,
Alberto Marchetti-Spaccamela,
Nicole Megow:
Algorithms and Complexity for Periodic Real-Time Scheduling.
SODA 2010: 1350-1359 |
| 35 |  | Ho-Leung Chan,
Tak Wah Lam,
Lap-Kei Lee,
Hing-Fung Ting:
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window.
STACS 2010: 179-190 |
| 34 |  | Ho-Leung Chan,
Tak Wah Lam,
Rongbin Li:
Tradeoff between Energy and Throughput for Online Deadline Scheduling.
WAOA 2010: 59-70 |
| 33 |  | Ho-Leung Chan,
Tak Wah Lam,
Wing-Kin Sung,
Siu-Lung Tam,
Swee-Seong Wong:
Compressed Indexes for Approximate String Matching.
Algorithmica 58(2): 263-281 (2010) |
| 32 |  | Ho-Leung Chan,
Nicole Megow,
Rob van Stee,
René Sitters:
The Sorting Buffer Problem is NP-hard
CoRR abs/1009.4355: (2010) |
| 2009 |
| 31 |  | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs,
Dmitriy Katz:
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule.
ICALP (1) 2009: 144-155 |
| 30 |  | Nikhil Bansal,
Ho-Leung Chan:
Weighted flow time does not admit O(1)-competitive algorithms.
SODA 2009: 1238-1244 |
| 29 |  | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Speed scaling with an arbitrary power function.
SODA 2009: 693-701 |
| 28 |  | Ho-Leung Chan,
Jeff Edmonds,
Kirk Pruhs:
Speed scaling of processes with arbitrary speedup curves on a multiprocessor.
SPAA 2009: 1-10 |
| 27 |  | 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 |
| 26 |  | Ho-Leung Chan,
Tak Wah Lam,
Lap-Kei Lee,
Hing-Fung Ting:
Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window.
WAOA 2009: 49-61 |
| 25 |  | Ho-Leung Chan,
Joseph Wun-Tat Chan,
Tak Wah Lam,
Lap-Kei Lee,
Kin-Sum Mak,
Prudence W. H. Wong:
Optimizing throughput and energy in online deadline scheduling.
ACM Transactions on Algorithms 6(1): (2009) |
| 24 |  | 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) |
| 23 |  | Ho-Leung Chan,
Tak Wah Lam,
Lap-Kei Lee,
Hing-Fung Ting:
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window
CoRR abs/0912.4569: (2009) |
| 22 |  | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Speed scaling with a solar cell.
Theor. Comput. Sci. 410(45): 4580-4587 (2009) |
| 2008 |
| 21 |  | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Speed Scaling with a Solar Cell.
AAIM 2008: 15-26 |
| 20 |  | Nikhil Bansal,
Ho-Leung Chan,
Tak Wah Lam,
Lap-Kei Lee:
Scheduling for Speed Bounded Processors.
ICALP (1) 2008: 409-420 |
| 19 |  | Nikhil Bansal,
David P. Bunde,
Ho-Leung Chan,
Kirk Pruhs:
Average Rate Speed Scaling.
LATIN 2008: 240-251 |
| 18 |  | 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 |  | 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 |  | Ho-Leung Chan,
Tak Wah Lam,
Prudence W. H. Wong:
Efficiency of Data Distribution in BitTorrent-Like Systems.
AAIM 2007: 378-388 |
| 15 |  | 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 |  | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling.
ICALP 2007: 28-39 |
| 13 |  | 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 |  | 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 |  | 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 |  | 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 |  | 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 |  | 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 |  | 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 |  | Ho-Leung Chan,
Wing-Kai Hon,
Tak Wah Lam,
Kunihiko Sadakane:
Dynamic dictionary matching and compressed suffix trees.
SODA 2005: 13-22 |
| 5 |  | 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 |  | 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 |  | 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 |  | Ho-Leung Chan,
Wing-Kai Hon,
Tak Wah Lam:
Compressed Index for a Dynamic Collection of Texts.
CPM 2004: 445-456 |
| 1 |  | Ho-Leung Chan,
Tak Wah Lam,
Kar-Keung To:
Non-migratory online deadline scheduling on multiprocessors.
SODA 2004: 970-979 |