A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast. - Regant Y. S. Hung; H. F. Ting (COCOON, 2006)

An Optimal Broadcasting Protocol for Mobile Video-on-Demand. - Regant Y. S. Hung; Hing-Fung Ting (CATS, 2007)

Finding Frequent Items in a Turnstile Data Stream. - Regant Y. S. Hung; Kwok Fai Lai; Hing-Fung Ting (COCOON, 2008)

Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream. - Regant Y. S. Hung; Hing-Fung Ting (LATIN, 2008)

Competitive analysis of most-request-first for scheduling broadcasts with start-up delay. - Regant Y. S. Hung; H. F. Ting (Theor. Comput. Sci., 2008)

A Near-Optimal Broadcasting Protocol for Mobile Video-on-Demand. - Regant Y. S. Hung; Hing-Fung Ting (Int. J. Found. Comput. Sci., 2009)

The complexities of tracking quantiles and frequent items in a data stream - Regant Y. S. Hung (2009)

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. - Regant Y. S. Hung; Hing-Fung Ting (FAW, 2010)

Design and Analysis of Online Batching Systems. - Regant Y. S. Hung; Hing-Fung Ting (Algorithmica, 2010)

Finding frequent items over sliding windows with constant update time. - Regant Y. S. Hung; Lap-Kei Lee; Hing-Fung Ting (Inf. Process. Lett., 2010)

An Efficient Representation Model of Distance Distribution between uncertain Objects. - Edward Hung; Lurong Xiao; Regant Y. S. Hung (Comput. Intell., 2012)