Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Isaac Kar-Keung To
Kar-Keung To
2010 – today
- 2013
[j12]Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong: Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy. Algorithmica 65(3): 605-633 (2013)- 2012
[j11]Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong: Improved multi-processor scheduling for flow time and energy. J. Scheduling 15(1): 105-116 (2012)- 2010
[j10]Xin Han, Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong: Deadline scheduling and power management for speed bounded processors. Theor. Comput. Sci. 411(40-42): 3587-3600 (2010)
2000 – 2009
- 2009
[c11]Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Isaac Kar-Keung To, Prudence W. H. Wong: Sleep with Guilt and Work Faster to Minimize Flow Plus Energy. ICALP (1) 2009: 665-676- 2008
[j9]Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong: Nonmigratory Multiprocessor Scheduling for Response Time and Energy. IEEE Trans. Parallel Distrib. Syst. 19(11): 1527-1539 (2008)
[c10]Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong: Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count. ESA 2008: 647-659
[c9]Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong: Competitive non-migratory scheduling for flow time and energy. SPAA 2008: 256-264- 2007
[c8]Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong: Energy Efficient Deadline Scheduling in Two Processor Systems. ISAAC 2007: 476-487- 2005
[j8]Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: A Tighter Extra-Resource Analysis of Online Deadline Scheduling. J. Comb. Optim. 9(2): 157-165 (2005)
[j7]Ho-Leung Chan, Tak Wah Lam, Kar-Keung To: Nonmigratory Online Deadline Scheduling on Multiprocessors. SIAM J. Comput. 34(3): 669-682 (2005)- 2004
[j6]Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To, Prudence W. H. Wong: Aggressive Online Deadline Scheduling. Electr. Notes Theor. Comput. Sci. 91: 148-157 (2004)
[j5]Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: Performance guarantee for EDF under overload. J. Algorithms 52(2): 193-206 (2004)
[j4]Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: Extra Processors versus Future Information in Optimal Deadline Scheduling. Theory Comput. Syst. 37(3): 323-341 (2004)
[c7]Ho-Leung Chan, Tak Wah Lam, Kar-Keung To: Non-migratory online deadline scheduling on multiprocessors. SODA 2004: 970-979- 2003
[j3]Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: Competitive Deadline Scheduling via Additional or Faster Processors. J. Scheduling 6(2): 213-223 (2003)
[j2]Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kunihiko Sadakane, Kar-Keung To: On-line scheduling with tight deadlines. Theor. Comput. Sci. 295: 251-261 (2003)- 2002
[j1]Tak Wah Lam, Hing-Fung Ting, Kar-Keung To, Prudence W. H. Wong: On-line load balancing of temporary tasks revisited. Theor. Comput. Sci. 270(1-2): 325-340 (2002)
[c6]Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: Extra processors versus future information in optimal deadline scheduling. SPAA 2002: 133-142- 2001
[c5]Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: On the speed requirement for optimal deadline scheduling in overloaded systems. IPDPS 2001: 202
[c4]Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: On-Line Scheduling with Tight Deadlines. MFCS 2001: 464-473
[c3]Tak Wah Lam, Kar-Keung To: Performance guarentee for online deadline scheduling in the presence of overload. SODA 2001: 755-764
1990 – 1999
- 1999
[c2]Kar-Keung To, Prudence W. H. Wong: On-Line Load Balancing of Temporary Tasks Revisited. ISAAC 1999: 103-112
[c1]Tak Wah Lam, Kar-Keung To: Trade-offs Between Speed and Processor in Hard-Deadline Scheduling. SODA 1999: 623-632
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-26 20:12 CET by the dblp team



