 | 2008 |
|---|
| 13 |       | Tsuen-Wan Ngan:
Reducing E-Discovery Cost by Filtering Included Emails.
CEAS 2008 |
| 2006 |
|---|
| 12 | | Atul Singh,
Tsuen-Wan Ngan,
Peter Druschel,
Dan S. Wallach:
Eclipse Attacks on Overlay Networks: Threats and Defenses.
INFOCOM 2006 |
| 2005 |
|---|
| 11 | | Animesh Nandi,
Tsuen-Wan Ngan,
Atul Singh,
Peter Druschel,
Dan S. Wallach:
Scrivener: Providing Incentives in Cooperative Content Distribution Systems.
Middleware 2005: 270-291 |
| 10 | | 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) |
| 2004 |
|---|
| 9 | | 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) |
| 8 | | Tak Wah Lam,
Tsuen-Wan Ngan,
Kar-Keung To:
Performance guarantee for EDF under overload.
J. Algorithms 52(2): 193-206 (2004) |
| 7 | | 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 |
|---|
| 6 | | Tsuen-Wan Ngan,
Dan S. Wallach,
Peter Druschel:
Enforcing Fair Sharing of Peer-to-Peer Resources.
IPTPS 2003: 149-159 |
| 5 |  | 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) |
| 4 | | 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 |
|---|
| 3 | | 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 |
|---|
| 2 | | Tak Wah Lam,
Tsuen-Wan Ngan,
Kar-Keung To:
On the speed requirement for optimal deadline scheduling in overloaded systems.
IPDPS 2001: 202 |
| 1 | | Chiu-Yuen Koo,
Tak Wah Lam,
Tsuen-Wan Ngan,
Kar-Keung To:
On-Line Scheduling with Tight Deadlines.
MFCS 2001: 464-473 |
