CHAN, Ho Leung ()
Assistant Professor
Department of Computer Science
The University of Hong Kong

Email:
Phone: (+852) 2219-4800
Fax: (+852) 2559-8447
Address: Room 420, CYC Building,
The University of Hong Kong,
Pokfulam Road, Hong Kong
Research interest. Online algorithms, data structures, mathematical analysis, theory of computation.
About me. I am an assistant professor in the University of Hong Kong (HKU), which locates in the very south of China. My research is mainly on the design and analysis of algorithms, with special interest in job scheduling. My work in the university includes research, teaching and learning. I like my job.

I studied Computer Engineering in HKU and graduated with a bachelor degree in 2002. Then I continued my PhD study in Computer Science there and graduated in 2007. I worked as a postdoc in University of Pittsburgh and Max-Planck-Institut für Informatik from 2007 to 2009, and returned to HKU afterwards. I am very thankful to my PhD advisor Tak-Wah Lam, my summer intern advisor Nikhil Bansal, and my postdoc advisor Kirk Pruhs for their guidance and help throughout the years.

I have a wonderful wife. In my leisure times, I like all kinds of sports, particularly marathon, hiking and swimming.
Teaching. I am glad to have chance advising the following graduate students.
  • Zhu Jianqiao
  • Li Rongbin
  • Pan Jiangwei
I am teaching/have taught the following courses.
  • c1122a - Computer programming II (Spring 2010, Spring 2011)
  • c1117b - Computer programming I (Fall 2010)
  • c1119a - Introduction to data structures and algorithms (Fall 2009)
I am also the coordinator for the following activities/projects.
  • ACM programming competition
  • HKU algorithms library
Publications. A detailed list can be found at DBLP. Below I group the papers by topics for the ease of reading. The copyright of the following papers belong to their respective copyright holders.

Energy efficient scheduling [related work]
  1. Energy-Efficient Due Date Scheduling.
    H. L. Chan, T. W. Lam, and R. Li. TAPAS 2011.
    2.  
  2. Tradeoff between energy and throughput for online deadline scheduling. [pdf]
    H. L. Chan, T. W. Lam, and R. Li. WAOA 2010.
    3.  
  3. Speed scaling with an arbitrary power function. [pdf]
    N. Bansal, H. L. Chan, and K. Pruhs. SODA 2009.
    4.  
  4. Improved bounds for speed scaling in devices obeying the cube-root rule. [pdf]
    N. Bansal, H. L. Chan, D. Katz, and K. Pruhs. ICALP 2009.
    5.  
  5. Nonclairvoyant Speed Scaling for Flow and Energy.
    H. L. Chan, J. Edmonds, T. W. Lam, L. K. Lee, A. Marchetti-Spaccamela, and K. Pruhs. STACS 2009.
    6.  
  6. Scheduling for Speed Bounded Processors.
    N. Bansal, H. L. Chan, T. W. Lam, and L. K. Lee. ICALP 2008.
    7.  
  7. Speed Scaling with a Solar Cell.
    N. Bansal, H. L. Chan, K. Pruhs. AAIM 2008, TCS 2009.
    8.  
  8. Average Rate Speed Scaling.
    N. Bansal, D. Bunde, H. L. Chan, K. Pruhs. LATIN 2008, Algorithmica 2011.
    9.  
  9. Energy efficient online deadline scheduling.
    H. L. Chan, W. T. Chan, T. W. Lam, L. K. Lee, K. S. Mak and P. W. H. Wong. SODA 2007, TALG 2009.
Other scheduling problems [related work]
  1. Algorithms and Complexity for Periodic Real-Time Scheduling.
    V. Bonifaci, H. L. Chan, A. Marchetti-Spaccamela, N. Megow. SODA 2010.
    2.  
  2. Weighted flow time does not admit O(1)-competitive algorithms.
    N. Bansal, and H. L. Chan. SODA 2009.
    3.  
  3. Competitive Algorithms for Due Date Scheduling.
    N. Bansal, H. L. Chan, K. Pruhs. ICALP 2007, Algorithmica 2011.
    4.  
  4. Non-preemptive min-sum scheduling with resource augmentation.
    N. Bansal, H. L. Chan, R. Khandekar, K. Pruhs, B. Schieber and C. Stein. FOCS 2007.
    5.  
  5. Extra unit-speed machines are almost as powerful as speedy machines for flow time scheduling.
    H. L. Chan. T. W. Lam, and K. S. Liu. SODA 2006, SICOMP 2008.
    6.  
  6. Non-migratory online deadline scheduling on multiprocessors.
    H. L. Chan, T. W. Lam, and K. K. To. SODA 2004, SICOMP 2005.
Text indexing
  1. Compressed indexes for approximate string matching.
    H. L. Chan, T. W. Lam, W. K. Sung, S. L. Tam, and S. S. Wong. ESA 2006.
    2.  
  2. A linear size index for approximate pattern matching.
    H. L. Chan, T. W. Lam, W. K. Sung, S. L. Tam, and S. S. Wong. CPM 2006.
    3.  
  3. Dynamic dictionary matching and compressed suffix trees.
    H. L. Chan, W. K. Hon, T. W. Lam, and K. Sadakane. CPM 2004, SODA 2005, TALG 2007.
    4.  
Bioinformatics
  1. Reconstructing an ultrametric galled phylogenetic network from a distance matrix.
    H. L. Chan, J. Jansson, T. W. Lam, and S. M. Yiu. MFCS 2005, JBCB 2006.
    2.  
  2. A mutation-sensitive approach for locating conserved gene pairs between related species.
    H. L. Chan, T. W. Lam, W. K. Sung, P. W. H. Wong, and S. M. Yiu. BIBE 2004, Bioinformatics 2005.
    3.  
Networking
  1. Efficiency of data distribution in BitTorrent-like systems.
    H. L. Chan, T. W. Lam and P. W. H. Wong. AAIM 2007.
    2.  
Grants. I have obtained the following grants.
  • "Competitive on-line scheduling algorithms for minimizing weighted flow time", GRF 2010 - 2013, $792,000.
  • "Energy-efficient on-line scheduling for overloaded systems", HKU Seed Funding 2010 - 2012, $120,000.
  • "The University of Hong Kong Algorithms Library (HKUAL)", UGC KE Grant 2010 - 2011, $64,000.
  • "Programming contests for secondary and university students", UGC KE Grant 2009 - 2010, $83,000.
Last updated: 2011-08-10.