A Mutation-Sensitive Approach for Locating Conserved Gene Pairs between Related Species. - Ho-Leung Chan; Tak Wah Lam; Wing-Kin Sung; Prudence W. H. Wong; Siu-Ming Yiu (BIBE, 2004)

Compressed Index for a Dynamic Collection of Texts. - Ho-Leung Chan; Wing-Kai Hon; Tak Wah Lam (CPM, 2004)

Non-migratory online deadline scheduling on multiprocessors. - Ho-Leung Chan; Tak Wah Lam; Kar-Keung To (SODA, 2004)

Dynamic dictionary matching and compressed suffix trees. - Ho-Leung Chan; Wing-Kai Hon; Tak Wah Lam; Kunihiko Sadakane (SODA, 2005)

The mutated subsequence problem and locating conserved genes. - Ho-Leung Chan; Tak Wah Lam; Wing-Kin Sung; Prudence W. H. Wong; Siu-Ming Yiu; X. Fan (Bioinform., 2005)

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

Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling. - Ho-Leung Chan; Tak Wah Lam; Kin-Shing Liu (SODA, 2006)

Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. - Ho-Leung Chan; Jesper Jansson 001; Tak Wah Lam; Siu-Ming Yiu (J. Bioinform. Comput. Biol., 2006)

Efficiency of Data Distribution in BitTorrent-Like Systems. - Ho-Leung Chan; Tak Wah Lam; Prudence W. H. Wong (AAIM, 2007)

Non-Preemptive Min-Sum Scheduling with Resource Augmentation. - Nikhil Bansal 001; Ho-Leung Chan; Rohit Khandekar; Kirk Pruhs; Clifford Stein 001; Baruch Schieber (FOCS, 2007)

Energy efficient online deadline scheduling. - Ho-Leung Chan; Wun-Tat Chan; Tak Wah Lam; Lap-Kei Lee; Kin-Sum Mak; Prudence W. H. Wong (SODA, 2007)

Compressed indexes for dynamic text collections. - Ho-Leung Chan; Wing-Kai Hon; Tak Wah Lam; Kunihiko Sadakane (ACM Trans. Algorithms, 2007)

New algorithms for on-line scheduling - Ho-Leung Chan (2007)

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

Non-overlapping Common Substrings Allowing Mutations. - Ho-Leung Chan; Tak Wah Lam; Wing-Kin Sung; Prudence W. H. Wong; Siu-Ming Yiu (Math. Comput. Sci., 2008)

Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling. - Ho-Leung Chan; Tak Wah Lam; Kin-Shing Liu (SIAM J. Comput., 2008)

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

Optimizing throughput and energy in online deadline scheduling. - Ho-Leung Chan; Joseph Wun-Tat Chan; Tak Wah Lam; Lap-Kei Lee; Kin-Sum Mak; Prudence W. H. Wong (ACM Trans. Algorithms, 2009)

Speed scaling with a solar cell. - Nikhil Bansal 001; Ho-Leung Chan; Kirk Pruhs (Theor. Comput. Sci., 2009)

Compressed Indexes for Approximate String Matching. - Ho-Leung Chan; Tak Wah Lam; Wing-Kin Sung; Siu-Lung Tam; Swee-Seong Wong (Algorithmica, 2010)

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

Edit Distance to Monotonicity in Sliding Windows. - Ho-Leung Chan; Tak Wah Lam; Lap-Kei Lee; Jiangwei Pan; Hing-Fung Ting; Qin Zhang 001 (ISAAC, 2011)

Energy-Efficient Due Date Scheduling. - Ho-Leung Chan; Tak Wah Lam; Rongbin Li (TAPAS, 2011)

Average Rate Speed Scaling. - Nikhil Bansal 001; David P. Bunde; Ho-Leung Chan; Kirk Pruhs (Algorithmica, 2011)

Competitive Algorithms for Due Date Scheduling. - Nikhil Bansal 001; Ho-Leung Chan; Kirk Pruhs (Algorithmica, 2011)

Nonclairvoyant Speed Scaling for Flow and Energy. - Ho-Leung Chan; Jeff Edmonds; Tak Wah Lam; Lap-Kei Lee; Alberto Marchetti-Spaccamela; Kirk Pruhs (Algorithmica, 2011)

Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window. - Hing-Fung Ting; Lap-Kei Lee; Ho-Leung Chan; Tak Wah Lam (Algorithms, 2011)

A linear size index for approximate pattern matching. - Ho-Leung Chan; Tak Wah Lam; Wing-Kin Sung; Siu-Lung Tam; Swee-Seong Wong (J. Discrete Algorithms, 2011)

Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor. - Ho-Leung Chan; Jeff Edmonds; Kirk Pruhs (Theory Comput. Syst., 2011)

Tradeoff between energy and throughput for online deadline scheduling. - Ho-Leung Chan; Tak Wah Lam; Rongbin Li (Sustain. Comput. Informatics Syst., 2011)

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

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

Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window. - Ho-Leung Chan; Tak Wah Lam; Lap-Kei Lee; Hing-Fung Ting (Algorithmica, 2012)

Algorithms and complexity for periodic real-time scheduling. - Vincenzo Bonifaci; Ho-Leung Chan; Alberto Marchetti-Spaccamela; Nicole Megow (ACM Trans. Algorithms, 2012)

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

Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. - Nikhil Bansal 001; Ho-Leung Chan; Dmitriy Katz; Kirk Pruhs (Theory Comput., 2012)

Competitive Online Algorithms for Multiple-Machine Power Management and Weighted Flow Time. - Ho-Leung Chan; Sze-Hang Chan; Tak Wah Lam; Lap-Kei Lee; Rongbin Li; Chi-Man Liu (CATS, 2013)

Aspectual Coercion in Non-native Speakers of English. - Ho-Leung Chan (CogSci, 2013)

Speed Scaling with an Arbitrary Power Function. - Nikhil Bansal 001; Ho-Leung Chan; Kirk Pruhs (ACM Trans. Algorithms, 2013)

Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models. - Jianqiao Zhu; Ho-Leung Chan; Tak Wah Lam (Theory Comput. Syst., 2015)