dblp.uni-trier.dewww.uni-trier.de

Patchrawat Uthaisombut Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Houman Alborzi [1] [5]
2Mark Brehob [4]
3Christine Chung [16]
4Jens S. Kohrt (Jens S. Frederiksen) [8]
5Kim S. Larsen [8]
6April Rasala Lehman (April Rasala) [6]
7John Noga [8]
8Kirk Pruhs [7] [10] [11] [12] [13] [15] [16]
9Rob van Stee [12] [13]
10Clifford Stein [6]
11Eric Torng [1] [2] [3] [4] [5] [6]
12Stephen Wagner [1] [5]
13Gerhard J. Woeginger [10] [15]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)