Ho Leung Chan
Assistant Professor
Department of Computer Science
The University of Hong Kong

Email:
Address: Room 420, CYC Building,
Pokfulam Road, Hong Kong


Hello! Welcome to my homepage.
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, especially on the area of job scheduling. My work in the university is mostly thinking problems, teaching and learning. I like my job very much.

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 very warm family and a very lovely girlfriend. In my leisure times, I like to play all kind of sports, particularly marathon, hiking and swimming.
Teaching. I enjoy teaching. I am very happy to have chance advising the following graduate students.
  • (To be confirmed)
Also, I am teaching / have taught the following courses.
  • (To be confirmed)
Research. My research is mostly on job scheduling. I have also worked on text indexing and some other topics. You may see a very detailed list in DBLP. Below, I grouped some of my publications by areas for our convenience.

Energy efficient scheduling
  1. Speed scaling with an arbitrary power function.
    N. Bansal, H. L. Chan, and K. Pruhs. SODA 2009.
    2.  
  2. 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.
    3.  
  3. Scheduling for Speed Bounded Processors.
    N. Bansal, H. L. Chan, T. W. Lam, and L. K. Lee. ICALP 2008.
    4.  
  4. Speed Scaling with a Solar Cell.
    N. Bansal, H. L. Chan, K. Pruhs. In AAIM, 2008.
    5.  
  5. 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. In SODA, 2007.
Other scheduling problems
  1. Weighted flow time does not admit O(1)-competitive algorithms.
    N. Bansal, and H. L. Chan. In SODA, 2009.
    2.  
  2. Competitive Algorithms for Due Date Scheduling.
    N. Bansal, H. L. Chan, K. Pruhs. In ICALP, 2007.
    3.  
  3. Non-preemptive min-sum scheduling with resource augmentation.
    N. Bansal, H. L. Chan, R. Khandekar, K. Pruhs, B. Schieber and C. Stein. In FOCS, 2007.
    4.  
  4. 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. In SODA, 2006, SIAM Journal on Computing, 2008.
    5.  
  5. Non-migratory online deadline scheduling on multiprocessors.
    H. L. Chan, T. W. Lam, and K. K. To. In SODA, 2004, SIAM Journal on Computing, 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. In 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. In CPM, 2006.
    3.  
  3. Dynamic dictionary matching and compressed suffix trees.
    H. L. Chan, W. K. Hon, T. W. Lam, and K. Sadakane. In 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. In 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. In 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. In AAIM, 2007.
    2.  
Last updated: 2009-04-18.