Ho Leung Chan
Postdoctoral Associate

Department of Computer Science
University of Pittsburgh

Address: Room 6406, Sennott Square Building
210 South Bouquet Street, Pittsburgh, PA 15260
Email: hlchan @ cs . pitt. edu
Phone: (412) 624-4773

Biography

I received my bachelor degree in Computer Engineering (with first class honors) in 2002 from University of Hong Kong. I continued pursuing my PhD degree in the same university under the supervision of Prof. Tak-Wah Lam. My thesis "New Algorithms for On-line Scheduling" was submitted in January 2007. Then I moved to University of Pittsburgh in 2007 and started working as a postdoctoral associate under the supervision of Prof. Kirk Pruhs.

My research interests are design and analysis of algorithms. I have worked on online scheduling, text indexing, and bioinformatics. I love my work, including both the research and the teaching assistant work. I got the Best Tutor Award in Computer Science Department, University of Hong Kong, in 2003, 2004 and 2006.

In my leisure times, I like to play all kind of sports, particularly marathon and hiking with friends.

Publications

A (probably) more updated list is in DBLP.

Journal Papers

  1. 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. To appear in SIAM Journal on Computing.

  2. Reconstructing an ultrametric galled phylogenetic network from a distance matrix. H. L. Chan, J. Jansson, T. W. Lam, and S. M. Yiu. To appear in Journal of Bioinformatics and Computational Biology.

  3. Dynamic dictionary matching and compressed suffix trees. H. L. Chan, W. K. Hon, T. W. Lam, and K. Sadakane. To appear in ACM Transactions of Algorithms.

  4. 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 Bioinformatics, 21(10), 2005.

  5. Non-migratory online deadline scheduling on multiprocessors. H. L. Chan, T. W. Lam, and K. K. To. In SIAM Journal on Computing, 34(3), 2005.

Conference Papers

  1. Non-preemptive min-sum scheduling with resource augmentation. N. Bansal, H. L. Chan, R. Khandekar, K. Pruhs, B. Schieber and C. Stein. To appear in Proceedings of FOCS, 2007.

  2. Competitive Algorithms for Due Date Scheduling. N. Bansal, H. L. Chan, K. Pruhs. In Proceedings of ICALP, 2007.

  3. Efficiency of data distribution in BitTorrent-like systems. H. L. Chan, T. W. Lam and P. W. H. Wong. In Proceedings of AAIM, 2007.

  4. 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 Proceedings of SODA, 2007.

  5. Compressed indexes for approximate string matching. H. L. Chan, T. W. Lam, W. K. Sung, S. L. Tam, and S. S. Wong. In Proceedings of ESA, 2006.

  6. 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 Proceedings of CPM, 2006. [pdf]

  7. Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling. H. L. Chan, T. W. Lam, and K. S. Liu. In Proceedings of SODA, 2006. [pdf]

  8. Reconstructing an ultrametric galled phylogenetic network from a distance matrix. H. L. Chan, J. Jansson, T. W. Lam, and S. M. Yiu. In Proceedings of MFCS, 2005. [pdf]

  9. Dynamic dictionary matching and compressed suffix trees. H. L. Chan, W. K. Hon, T. W. Lam, and K. Sadakane. In Proceedings of SODA, 2005, pages 13-22. [pdf]

  10. Compressed index for a dynamic collection of texts. H. L. Chan, W. K. Hon, and T. W. Lam. In Proceedings of CPM, 2004, pages 445-456. [pdf]

  11. 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 Proceedings of BIBE, 2004, pages 545-552. [ps]

  12. Non-migratory online deadline scheduling on multiprocessors. H. L. Chan, T. W. Lam, and K. K. To. In Proceedings of SODA, 2004, pages 970-979. [pdf]
Last updated: 2007-09-07.