The k-Client Problem. - Houman Alborzi; Eric Torng; Patchrawat Uthaisombut; Stephen Wagner (SODA, 1997)

Lower Bounds for SRPT-Subsequence Algorithms for Nonpreemptive Scheduling. - Eric Torng; Patchrawat Uthaisombut (SODA, 1999)

A Tight Lower Bound for the Best-alpha Algorithm. - Eric Torng; Patchrawat Uthaisombut (Inf. Process. Lett., 1999)

Applying extra-resource analysis to load balancing. - Mark Brehob; Eric Torng; Patchrawat Uthaisombut (SODA, 2000)

The k-Client Problem. - Houman Alborzi; Eric Torng; Patchrawat Uthaisombut; Stephen Wagner (J. Algorithms, 2001)

Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. - April Rasala; Clifford Stein 001; Eric Torng; Patchrawat Uthaisombut (SODA, 2002)

Dynamic TCP acknowledgment in the LogP model. - Jens S. Frederiksen; Kim S. Larsen; John Noga; Patchrawat Uthaisombut (J. Algorithms, 2003)

The Optimal Online Algorithms for Minimizing Maximum Lateness. - Patchrawat Uthaisombut (SWAT, 2004)

A Comparison of Multicast Pull Models. - Kirk Pruhs; Patchrawat Uthaisombut (Algorithmica, 2005)

The Online Transportation Problem: On the Exponential Boost of One Extra Server. - Christine Chung 001; Kirk Pruhs; Patchrawat Uthaisombut (LATIN, 2008)

Generalization of EDF and LLF: Identifying All Optimal Online Algorithms for Minimizing Maximum Lateness. - Patchrawat Uthaisombut (Algorithmica, 2008)

Speed Scaling of Tasks with Precedence Constraints. - Kirk Pruhs; Rob van Stee; Patchrawat Uthaisombut (Theory Comput. Syst., 2008)

Getting the best response for your erg. - Kirk Pruhs; Patchrawat Uthaisombut; Gerhard J. Woeginger (ACM Trans. Algorithms, 2008)