Search the dblp DataBase

Publications of Author

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