The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Kar-Keung To: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
    On the speed requirement for optimal deadline scheduling in overloaded systems. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:202- [Conf]
  2. Kar-Keung To, Prudence W. H. Wong
    On-Line Load Balancing of Temporary Tasks Revisited. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:103-112 [Conf]
  3. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
    On-Line Scheduling with Tight Deadlines. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:464-473 [Conf]
  4. Ho-Leung Chan, Tak Wah Lam, Kar-Keung To
    Non-migratory online deadline scheduling on multiprocessors. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:970-979 [Conf]
  5. Tak Wah Lam, Kar-Keung To
    Performance guarentee for online deadline scheduling in the presence of overload. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:755-764 [Conf]
  6. Tak Wah Lam, Kar-Keung To
    Trade-offs Between Speed and Processor in Hard-Deadline Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:623-632 [Conf]
  7. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
    Extra processors versus future information in optimal deadline scheduling. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:133-142 [Conf]
  8. Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To, Prudence W. H. Wong
    Aggressive Online Deadline Scheduling. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:91, n:, pp:148-157 [Journal]
  9. Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
    Performance guarantee for EDF under overload. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:2, pp:193-206 [Journal]
  10. Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
    A Tighter Extra-Resource Analysis of Online Deadline Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:2, pp:157-165 [Journal]
  11. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
    Extra Processors versus Future Information in Optimal Deadline Scheduling. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:3, pp:323-341 [Journal]
  12. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
    Competitive Deadline Scheduling via Additional or Faster Processors. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2003, v:6, n:2, pp:213-223 [Journal]
  13. Ho-Leung Chan, Tak Wah Lam, Kar-Keung To
    Nonmigratory Online Deadline Scheduling on Multiprocessors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:669-682 [Journal]
  14. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kunihiko Sadakane, Kar-Keung To
    On-line scheduling with tight deadlines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:251-261 [Journal]
  15. Tak Wah Lam, Hing-Fung Ting, Kar-Keung To, Prudence W. H. Wong
    On-line load balancing of temporary tasks revisited. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:325-340 [Journal]

Search in 0.023secs, Finished in 0.024secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002