Showing results 1 to 10 of 10
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay Journal:Theoretical Computer Science | 2008 | 126 | ||
Design and analysis of online batching systems Journal:Algorithmica (New York) | 2010 | 197 | ||
Design and analysis of online batching systems Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2006 | 187 | ||
Finding frequent items in a turnstile data stream Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2008 | 124 | ||
Finding frequent items over sliding windows with constant update time Journal:Information Processing Letters | 2010 | |||
Finding heavy hitters over the sliding window of a weighted data stream Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2008 | 121 | ||
A near-optimal broadcasting protocol for mobile video-on-demand Journal:International Journal of Foundations of Computer Science | 2009 | 107 | ||
An optimal broadcasting protocol for mobile video-on-demand Proceeding/Conference:Proceedings of the 13th Australasian Theory Symposium | 2007 | 103 | ||
A tight analysis of most-requested-first for on-demand data broadcast Proceeding/Conference:Lecture Notes in Computer Science | 2006 | 130 | ||
An Ω(1/εlog1/ε) space lower bound for finding e-approximate quantiles in a data stream Proceeding/Conference:Lecture Notes in Computer Science | 2010 | 96 |