Kar-Keung To
List of publications from the DBLP Bibliography Server - FAQ
| 2009 | ||
|---|---|---|
| 20 | 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 | ||
| 19 | 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 | |
| 18 | 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 | |
| 17 | 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) | |
| 2007 | ||
| 16 | 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 | ||
| 15 | 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) | |
| 14 | Ho-Leung Chan, Tak Wah Lam, Kar-Keung To: Nonmigratory Online Deadline Scheduling on Multiprocessors. SIAM J. Comput. 34(3): 669-682 (2005) | |
| 2004 | ||
| 13 | Ho-Leung Chan, Tak Wah Lam, Kar-Keung To: Non-migratory online deadline scheduling on multiprocessors. SODA 2004: 970-979 | |
| 12 | 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) | |
| 11 | Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: Performance guarantee for EDF under overload. J. Algorithms 52(2): 193-206 (2004) | |
| 10 | 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) | |
| 2003 | ||
| 9 | 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) | |
| 8 | 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 | ||
| 7 | 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 | |
| 6 | 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) | |
| 2001 | ||
| 5 | Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: On the speed requirement for optimal deadline scheduling in overloaded systems. IPDPS 2001: 202 | |
| 4 | Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: On-Line Scheduling with Tight Deadlines. MFCS 2001: 464-473 | |
| 3 | Tak Wah Lam, Kar-Keung To: Performance guarentee for online deadline scheduling in the presence of overload. SODA 2001: 755-764 | |
| 1999 | ||
| 2 | Kar-Keung To, Prudence W. H. Wong: On-Line Load Balancing of Temporary Tasks Revisited. ISAAC 1999: 103-112 | |
| 1 | Tak Wah Lam, Kar-Keung To: Trade-offs Between Speed and Processor in Hard-Deadline Scheduling. SODA 1999: 623-632 | |
| 1 | Ho-Leung Chan | [13] [14] |
| 2 | Chiu-Yuen Koo | [4] [7] [8] [9] [10] |
| 3 | Tak Wah Lam | [1] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] |
| 4 | Lap-Kei Lee | [16] [17] [18] [19] [20] |
| 5 | Tsuen-Wan Ngan | [4] [5] [7] [8] [9] [10] [11] [12] [15] |
| 6 | Kunihiko Sadakane | [8] |
| 7 | Hing-Fung Ting (H. F. Ting) | [6] [20] |
| 8 | Prudence W. H. Wong | [2] [6] [12] [16] [17] [18] [19] [20] |