 | 2010 |
|---|
| 10 |       | Regant Y. S. Hung,
Hing-Fung Ting:
An W(\frac1e log\frac1e)\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon}) Space Lower Bound for Finding epsilon-Approximate Quantiles in a Data Stream.
FAW 2010: 89-100 |
| 9 | | Regant Y. S. Hung,
Hing-Fung Ting:
Design and Analysis of Online Batching Systems.
Algorithmica 57(2): 217-231 (2010) |
| 8 | | Regant Y. S. Hung,
Lap-Kei Lee,
Hing-Fung Ting:
Finding frequent items over sliding windows with constant update time.
Inf. Process. Lett. 110(7): 257-260 (2010) |
| 2009 |
|---|
| 7 | | Regant Y. S. Hung,
Hing-Fung Ting:
A Near-Optimal Broadcasting Protocol for Mobile Video-on-Demand.
Int. J. Found. Comput. Sci. 20(1): 45-55 (2009) |
| 2008 |
|---|
| 6 | | Regant Y. S. Hung,
Kwok Fai Lai,
Hing-Fung Ting:
Finding Frequent Items in a Turnstile Data Stream.
COCOON 2008: 498-509 |
| 5 | | Regant Y. S. Hung,
Hing-Fung Ting:
Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream.
LATIN 2008: 699-710 |
| 4 | | Regant Y. S. Hung,
H. F. Ting:
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay.
Theor. Comput. Sci. 396(1-3): 200-211 (2008) |
| 2007 |
|---|
| 3 | | Regant Y. S. Hung,
Hing-Fung Ting:
An Optimal Broadcasting Protocol for Mobile Video-on-Demand.
CATS 2007: 79-84 |
| 2006 |
|---|
| 2 | | Regant Y. S. Hung,
H. F. Ting:
A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast.
COCOON 2006: 330-339 |
| 1 | | Regant Y. S. Hung,
Hing-Fung Ting:
Design and Analysis of Online Batching Systems.
LATIN 2006: 605-616 |
Data released under the ODC-BY 1.0 license — See also our legal information page