| 2008 |
|---|
| 16 | EE | Christine Chung,
Kirk Pruhs,
Patchrawat Uthaisombut:
The Online Transportation Problem: On the Exponential Boost of One Extra Server.
LATIN 2008: 228-239 |
| 15 | EE | Kirk Pruhs,
Patchrawat Uthaisombut,
Gerhard J. Woeginger:
Getting the best response for your erg.
ACM Transactions on Algorithms 4(3): (2008) |
| 14 | EE | Patchrawat Uthaisombut:
Generalization of EDF and LLF: Identifying All Optimal Online Algorithms for Minimizing Maximum Lateness.
Algorithmica 50(3): 312-328 (2008) |
| 13 | EE | Kirk Pruhs,
Rob van Stee,
Patchrawat Uthaisombut:
Speed Scaling of Tasks with Precedence Constraints.
Theory Comput. Syst. 43(1): 67-80 (2008) |
| 2005 |
|---|
| 12 | EE | Kirk Pruhs,
Rob van Stee,
Patchrawat Uthaisombut:
Speed Scaling of Tasks with Precedence Constraints.
WAOA 2005: 307-319 |
| 11 | EE | Kirk Pruhs,
Patchrawat Uthaisombut:
A Comparison of Multicast Pull Models.
Algorithmica 42(3-4): 289-307 (2005) |
| 2004 |
|---|
| 10 | EE | Kirk Pruhs,
Patchrawat Uthaisombut,
Gerhard J. Woeginger:
Getting the Best Response for Your Erg.
SWAT 2004: 14-25 |
| 9 | EE | Patchrawat Uthaisombut:
The Optimal Online Algorithms for Minimizing Maximum Lateness.
SWAT 2004: 420-430 |
| 2003 |
|---|
| 8 | EE | Jens S. Frederiksen,
Kim S. Larsen,
John Noga,
Patchrawat Uthaisombut:
Dynamic TCP acknowledgment in the LogP model.
J. Algorithms 48(2): 407-428 (2003) |
| 2002 |
|---|
| 7 | EE | Kirk Pruhs,
Patchrawat Uthaisombut:
A Comparison of Multicast Pull Models.
ESA 2002: 808-819 |
| 6 | EE | April Rasala,
Clifford Stein,
Eric Torng,
Patchrawat Uthaisombut:
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives.
SODA 2002: 723-731 |
| 2001 |
|---|
| 5 | EE | Houman Alborzi,
Eric Torng,
Patchrawat Uthaisombut,
Stephen Wagner:
The k-Client Problem.
J. Algorithms 41(2): 115-173 (2001) |
| 2000 |
|---|
| 4 | EE | Mark Brehob,
Eric Torng,
Patchrawat Uthaisombut:
Applying extra-resource analysis to load balancing.
SODA 2000: 560-561 |
| 1999 |
|---|
| 3 | EE | Eric Torng,
Patchrawat Uthaisombut:
Lower Bounds for SRPT-Subsequence Algorithms for Nonpreemptive Scheduling.
SODA 1999: 973-974 |
| 2 | EE | Eric Torng,
Patchrawat Uthaisombut:
A Tight Lower Bound for the Best-alpha Algorithm.
Inf. Process. Lett. 71(1): 17-22 (1999) |
| 1997 |
|---|
| 1 | | Houman Alborzi,
Eric Torng,
Patchrawat Uthaisombut,
Stephen Wagner:
The k-Client Problem.
SODA 1997: 73-82 |
