Ho-Leung Chan

Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

Competitive Online Algorithms for Multiple-Machine Power Management and Weighted Flow Time.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Computing: The Australasian Theory Symposium, 2013

2012

A note on sorting buffers offline.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Non-clairvoyant weighted flow time scheduling with rejection penalty.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Online Flow Time Scheduling in the Presence of Preemption Overhead.

[BibT_eX]

[DOI]

Rongbin Li

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models.

[BibT_eX]

[DOI]

Jianqiao Zhu

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Energy-Efficient Due Date Scheduling.

[BibT_eX]

[DOI]

Rongbin Li

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Edit Distance to Monotonicity in Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

The Sorting Buffer Problem is NP-hard

[BibT_eX]

[DOI]

CoRR, 2010

Tradeoff between Energy and Throughput for Online Deadline Scheduling.

[BibT_eX]

[DOI]

Rongbin Li

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Algorithms and Complexity for Periodic Real-Time Scheduling.

[BibT_eX]

[DOI]

Vincenzo Bonifaci

Alberto Marchetti-Spaccamela

Nicole Megow

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Optimizing throughput and energy in online deadline scheduling.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Nonclairvoyant Speed Scaling for Flow and Energy.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Speed scaling of processes with arbitrary speedup curves on a multiprocessor.

[BibT_eX]

[DOI]

Jeff Edmonds

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Speed scaling with an arbitrary power function.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Weighted flow time does not admit O(1)-competitive algorithms.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling.

[BibT_eX]

[DOI]

Kin-Shing Liu

SIAM J. Comput., 2008

Non-overlapping Common Substrings Allowing Mutations.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2008

Average Rate Speed Scaling.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Scheduling for Speed Bounded Processors.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Speed Scaling with a Solar Cell.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

New algorithms for on-line scheduling

[BibT_eX]

[DOI]

PhD thesis, 2007

Compressed indexes for dynamic text collections.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Energy efficient online deadline scheduling.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Competitive Algorithms for Due Date Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Non-Preemptive Min-Sum Scheduling with Resource Augmentation.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

Efficiency of Data Distribution in BitTorrent-Like Systems.

[BibT_eX]

[DOI]

Prudence W. H. Wong

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling.

[BibT_eX]

[DOI]

Kin-Shing Liu

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Compressed Indexes for Approximate String Matching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

A Linear Size Index for Approximate Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005

Nonmigratory Online Deadline Scheduling on Multiprocessors.

[BibT_eX]

[DOI]

Kar-Keung To

SIAM J. Comput., 2005

The mutated subsequence problem and locating conserved genes.

[BibT_eX]

[DOI]

Bioinform., 2005

Dynamic dictionary matching and compressed suffix trees.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

Non-migratory online deadline scheduling on multiprocessors.

[BibT_eX]

[DOI]

Kar-Keung To

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Compressed Index for a Dynamic Collection of Texts.

[BibT_eX]

[DOI]

Wing-Kai Hon