| | Title | Author(s) | Year | View Count | | 1 |  | Continuous monitoring of distributed data streams over a time-based sliding window | Chan, HL; Lam, TW; Lee, LK; Ting, HF | 2012 | 124 |
| 2 | | Online call control in cellular networks revisited | Zhang, Y; Chin, FYL; Ting, HF; Chan, JWT; Han, X; Lam, KC | 2012 | 80 |
| 3 | | A note on a selfish bin packing problem | Ma, R; Dósa, G; Han, X; Ting, HF; Ye, D; Zhang, Y | 2012 | 91 |
| 4 |  | Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing | Zhang, Y; Chin, FYL; Ting, HF; Han, X | 2012 | 126 |
| 5 |  | Competitive Algorithms for Online Pricing | Zhang, Y; Chin, FYL; Ting, HF | 2012 | 45 |
| 6 | | Online tree node assignment with resource augmentation | Chan, JWT; Chin, FYL; Ting, HF; Zhang, Y | 2011 | 139 |
| 7 | | Uniformly inserting points on square grid | Zhang, Y; Chang, Z; Chin, FYL; Ting, HF; Tsin, YH | 2011 | 139 |
| 8 | | Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors | Chan, SH; Lam, TW; Lee, LK; Ting, HF; Zhang, P | 2011 | 714 |
| 9 | | A new upper bound 2.5545 on 2D online bin packing | Han, X; Han, X; Chin, FYL; Ting, HF; Zhang, GC; Zhang, Y | 2011 | 75 |
| 10 | | Approximating frequent items in asynchronous data stream over a sliding window | Ting, HF; Lee, LK; Chan, HL; Lam, TW | 2011 | 94 |
| 11 | | Finding frequent items over sliding windows with constant update time | Hung, RYS; Lee, LK; Ting, HF | 2010 | 191 |
| 12 | | Design and analysis of online batching systems | Hung, RYS; Ting, HF | 2010 | 162 |
| 13 | | A near-optimal broadcasting protocol for mobile video-on-demand | Hung, RYS; Ting, HF | 2009 | 194 |
| 14 | | Online problems for frequency assignment and OVSF code assignment in wireless communication networks | Chan, JWT; Chin, FYL; Ting, HF; Zhang, Y | 2009 | 118 |
| 15 | | Competitive analysis of most-request-first for scheduling broadcasts with start-up delay | Hung, RYS; Ting, HF | 2008 | 116 |
| 16 | | From constrained to unconstrained maximum agreement subtree in linear time | Berry, V; Peng, ZS; Ting, HF | 2008 | 145 |
| 17 | | A near optimal scheduler for on-demand data broadcasts | Ting, HF | 2008 | 72 |
| 18 | | Allowing Mismatches In Anchors For Whole Genome Alignment | Yiu, SM; Chan, PY; Lam, TW; Sung, WK; Ting, HF; Wong, PWH | 2007 | 185 |
| 19 | | An efficient algorithm for online square detection | Leung, HF; Peng, ZS; Ting, HF | 2006 | 147 |
| 20 | | An optimal algorithm for maximum constrained agreement subtree for binary trees | Ting, HF; Peng, Z | 2006 | 116 |
|
