default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsaac Kar-Keung To
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2000
[b1]Isaac Kar-Keung To:
On-line deadline scheduling under relaxed metrics of optimality. University of Hong Kong, 2000
Journal Articles
- 2013
- [j11]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
- [j10]Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong:
Improved multi-processor scheduling for flow time and energy. J. Sched. 15(1): 105-116 (2012) - 2010
- [j9]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) - 2008
- [j8]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 Distributed Syst. 19(11): 1527-1539 (2008) - 2005
- [j7]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) - [j6]Ho-Leung Chan, Tak Wah Lam, Kar-Keung To:
Nonmigratory Online Deadline Scheduling on Multiprocessors. SIAM J. Comput. 34(3): 669-682 (2005) - 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) - 2003
- [j3]Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To:
Competitive Deadline Scheduling via Additional or Faster Processors. J. Sched. 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)
Conference and Workshop Papers
- 2009
- [c12]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
- [c11]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 - [c10]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
- [c9]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 - 2004
- [c8]Ho-Leung Chan, Tak Wah Lam, Kar-Keung To:
Non-migratory online deadline scheduling on multiprocessors. SODA 2004: 970-979 - [c7]Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To, Prudence W. H. Wong:
Aggressive Online Deadline Scheduling. CATS 2004: 148-157 - 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 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
