Dr. H.F. Ting

BSc CUHK; MPhil HK; PhD Princeton
Associate Professor

Tel: (+852) 2859 8944
Fax: (+852) 2559 8447
Email: hfting<at>

Dr. Ting received his PhD from Princeton University and joined this department in 1994. His research interests include bioinformatics, computational compleixty and design and analysis of alogirthms, and has published over forty papers in these areas. Dr. Ting is also an active member of the ACM(HK). He was the programme committee chair of the ACM(HK) Postgraduate Day 2002, and was in the programme committee of the ACM(HK) Postgraduate Day 2003.

More about other publications:

Research Interests

Bioinformatics, Design and Analysis of Algorithm, Computational Complexity

Selected Publications

  • Chan S.H., Lam T.W., Lee L.K., Liu C.M., Ting H.F., Sleep management on multiple machines for energy and flow time, Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP), pp.219--231, 2011
  • Hung Y.S. and Ting H.F, Design and analysis of online batching systems, Algorithmica, 57(2):217--228, 2010
  • Chin F.Y.L, Ting H.F., Y. Zhang, A Constant-competitive algorithm for online OVSF Code Assignment, Algorithmica, 57(1):89--104, 2010
  • Chan H.L., Lam T.W., Lee L.K. and Ting H.F., Continuous monitoring of distributed data streams over a time-based sliding window, Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), pp.179--190, 2010
  • Lam T.W., Lee L.K., Ting H.F., To K.K. and Wong W.H., Sleep with guilt and work faster to minimize flow plus energy, Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP), pp.665--676, 2009
  • Ting H.F., A near optimal scheduler for on-demand data broadcasts, Theoretical Computer Science, 401:77--84, 2008
  • Berry V., Peng Z.S. and Ting H.F., From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time, Algorithmica, 50(3):369--385, 2008
  • Peng Z.S. and Ting H.F., Guided forest edit distance: better structure comparisons by using domain-knowledge, Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching (CPM), pp.195--204, 2007
  • Lee L.K. and Ting H.F., Maintain Significant Statistics over Sliding Window, Proceedings of the 16th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.724--732, 2006
  • Lee L.K. and Ting H.F., A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items Over Sliding Windows, Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp.290--297, 2006

Recent Research Grants

  • Design and analysis of online algorithms for graph coloring with applications in frequency assignments (PI), September, 2008 (2 years), $274,777
  • Design and analysis of algorithm for identifying recently-frequent time in data streams (PI), June, 2007 (2 years), $350,249
  • Design and analysis of algorithms for constrained structure comparisons (PI), September, 2006 (2 years), $612,816