Ho-Leung Chan

Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Speed Scaling with an Arbitrary Power Function. ACM Transactions on Algorithms 9(2): 18 (2013)

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)

Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow: Algorithms and complexity for periodic real-time scheduling. ACM Transactions on Algorithms 9(1): 6 (2012)

Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee: A note on sorting buffers offline. Theor. Comput. Sci. 423: 11-18 (2012)

Nikhil Bansal, Ho-Leung Chan, Dmitriy Katz, Kirk Pruhs: Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. Theory of Computing 8(1): 209-229 (2012)

Ho-Leung Chan, Tak Wah Lam, Rongbin Li: Online Flow Time Scheduling in the Presence of Preemption Overhead. APPROX-RANDOM 2012: 85-97

Ho-Leung Chan, Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Jianqiao Zhu: Non-clairvoyant weighted flow time scheduling with rejection penalty. SPAA 2012: 246-254

Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Competitive Algorithms for Due Date Scheduling. Algorithmica 59(4): 569-582 (2011)

Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs: Average Rate Speed Scaling. Algorithmica 60(4): 877-889 (2011)

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)

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)

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)

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)

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

Ho-Leung Chan, Tak Wah Lam, Rongbin Li: Energy-Efficient Due Date Scheduling. TAPAS 2011: 69-80

Jianqiao Zhu, Ho-Leung Chan, Tak Wah Lam: Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models. WAOA 2011: 137-149

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)

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)

Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow: Algorithms and Complexity for Periodic Real-Time Scheduling. SODA 2010: 1350-1359

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

Ho-Leung Chan, Tak Wah Lam, Rongbin Li: Tradeoff between Energy and Throughput for Online Deadline Scheduling. WAOA 2010: 59-70

Ho-Leung Chan, Nicole Megow, Rob van Stee, René Sitters: The Sorting Buffer Problem is NP-hard. CoRR abs/1009.4355 (2010)

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)

Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Speed scaling with a solar cell. Theor. Comput. Sci. 410(45): 4580-4587 (2009)

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

Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Speed scaling with an arbitrary power function. SODA 2009: 693-701

Nikhil Bansal, Ho-Leung Chan: Weighted flow time does not admit O(1)-competitive algorithms. SODA 2009: 1238-1244

Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs: Speed scaling of processes with arbitrary speedup curves on a multiprocessor. SPAA 2009: 1-10

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

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

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)

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)

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)

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)

Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Speed Scaling with a Solar Cell. AAIM 2008: 15-26

Nikhil Bansal, Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee: Scheduling for Speed Bounded Processors. ICALP (1) 2008: 409-420

Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs: Average Rate Speed Scaling. LATIN 2008: 240-251

Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane: Compressed indexes for dynamic text collections. ACM Transactions on Algorithms 3(2) (2007)

Ho-Leung Chan, Tak Wah Lam, Prudence W. H. Wong: Efficiency of Data Distribution in BitTorrent-Like Systems. AAIM 2007: 378-388

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

Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Competitive Algorithms for Due Date Scheduling. ICALP 2007: 28-39

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

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)

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

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

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

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)

Ho-Leung Chan, Tak Wah Lam, Kar-Keung To: Nonmigratory Online Deadline Scheduling on Multiprocessors. SIAM J. Comput. 34(3): 669-682 (2005)

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

Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane: Dynamic dictionary matching and compressed suffix trees. SODA 2005: 13-22

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

Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam: Compressed Index for a Dynamic Collection of Texts. CPM 2004: 445-456

Ho-Leung Chan, Tak Wah Lam, Kar-Keung To: Non-migratory online deadline scheduling on multiprocessors. SODA 2004: 970-979