Isaac's Publications

Hint: for copyright reasons, the titles of the publications listed below are linked to the article in the publishers web sites (usually requiring subscription to access). To see the text of the publications below, see if it has a citeseer or citeseerx entry, where you can download the complete text and can also see a list of citations.

• Tak-Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To and Prudence Wai-Ha Wong.
  Non-migratory Multi-processor Scheduling for Response Time and Energy.
  To appear in IEEE Transactions on Parallel and Distributed Systems.^(bibtex)
• Tak-Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To and Prudence Wai-Ha Wong.
  Speed Scaling Functions for Flow Time Scheduling based on Active Job Count.
  To appear in the 16th European Symposia on Algorithms (ESA), 2008.^{(bibtex; PDF--archived with permission by copyright holder, © Springer-Verlag Berlin Heidelberg 2008)}
• Tak-Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To and Prudence Wai-Ha Wong.
  Competitive Non-migratory Scheduling for Flow Time and Energy.
  In Proceedings of the 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp 256--264, 2008.^(bibtex)
• Tak-Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To and Prudence Wai-Ha Wong.
  Energy Efficient Deadline Scheduling in Two Processor Systems.
  In Proceedings of the 18th International Symposium on Algorithms and Computation, pp 476--487, 2007.^{(bibtex; PDF--archived with permission by copyright holder, © Springer-Verlag Berlin Heidelberg 2007)}
• Tak-Wah Lam, Tsuen-Wan Ngan and Isaac Kar-Keung To.
  A Tighter Extra-Resource Analysis of Online Deadline Scheduling.
  Journal of combinatorial optimization, 9(2), pp 157--165, 2005.^{(citeseerx entry; bibtex)}
• Ho-Leung Chan, Tak-Wah Lam and Isaac Kar-Keung To.
  Non-migratory online deadline scheduling on multiprocessors.
  SIAM Journal on Computing, 34(3), pp 669--682, 2005.^(bibtex)
  • Conference version: Ho-Leung Chan, Tak-Wah Lam and Isaac Kar-Keung To.
    Non-migratory online deadline scheduling on multiprocessors.
    In Proceedings of the 15th annual ACM-SIAM symposium on Discrete algorithms (SODA), pp 970--979, 2004.^(bibtex)
• Tak-Wah Lam, Tsuen-Wan Ngan, Isaac Kar-Keung To and Prudence Wai-Ha Wong.
  Aggressive Online Deadline Scheduling.
  Electronic Notes in Theoretical Computer Science, 91, pp 148--157, 2004.^{(citeseer entry; bibtex)}
• Tak-Wah Lam, Tsuen-Wan Ngan and Isaac Kar-Keung To.
  Performance guarantee for EDF under overload.
  Journal of Algorithms, 52(2), pp 193--206, 2004.^{(citeseer entry; bibtex)}
• Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan and Isaac Kar-Keung To.
  Extra Processors versus Future Information in Optimal Deadline Scheduling.
  Theory of Computing Systems, 37(3), pp 323--341, 2004.^(bibtex)
  • Conference version: Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan and Isaac Kar-Keung To.
    Extra Processors versus Future Information in Optimal Deadline Scheduling.
    In Proceedings of the 14th ACM Annual Symposium on Parallel Algorithms and Architectures (SPAA), pp 133--142, 2002.^{(citeseer entry; bibtex)}
• Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan and Isaac Kar-Keung To.
  Competitive Deadline Scheduling Via Additional or Faster Processors.
  Journal of Scheduling, 6(2), pp 213--223, 2003.^{(citeseer entry; bibtex)}
• Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan, Kunihiko Sadakane and Isaac Kar-Keung To.
  Online Scheduling with Tight Deadlines.
  Theoretical Computer Science, 295(1--3), pp 251--261, 2003.^{(citeseer entry; bibtex)}
  • Conference version: Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan and Isaac Kar-Keung To.
    Online Scheduling with Tight Deadlines.
    In Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp 464--473, 2001.^{(citeseer entry; bibtex)}
• Tak-Wah Lam, Hing-Fung Ting, Isaac Kar-Keung To and Prudence Wai-Ha Wong.
  Online Load Balancing of Temporary Tasks Revisited.
  Theoretical Computer Science, 270(1--2), pp 325--340, 2002.^{(citeseer entry; bibtex)}
  • Conference version: Isaac Kar-Keung To and Prudence Wai-Ha Wong.
    On-line Load Balancing with Temporary Tasks Revisited.
    In Proceedings of the 10th International Symposium on Algorithms and Computation, pp 103--112, 1999.^(bibtex)
• Tak-Wah Lam, Tsuen-Wan Ngan and Isaac Kar-Keung To.
  On the Speed Requirement for Optimal Deadline Scheduling in Overloaded Systems.
  In Proceedings of the 15th International Parallel and Distributed Processing Symposium, pp 2173--2177, 2001.^{(citeseer entry; bibtex)}
• Tak-Wah Lam and Isaac Kar-Keung To.
  Performance Guarantee for Online Deadline Scheduling in the Presence of Overload.
  In Proceedings of the 20thannual ACM-SIAM symposium on Discrete algorithms (SODA), pp 755--764, 2001.^{(citeseer entry; bibtex)}
• Tak-Wah Lam and Isaac Kar-Keung To.
  Trade-offs between Speed and Processor in Hard-deadline Scheduling.
  In Proceedings of the 10th annual ACM-SIAM symposium on Discrete algorithms (SODA), pp 623--632, 1999.^{(citeseer entry; bibtex)}
• Tak-Wah Lam and Isaac Kar-Keung To.
  The dynamic dictionary matching problem revisited.
  In Proceedings of the International Conference on Algorithms 1996, pp 169--174, 1996.^{(citeseer entry; bibtex)}

Top Contact Personal Teaching Publications Friends Recreation Links