Patchrawat Uthaisombut

According to our database, Patchrawat Uthaisombut authored at least 13 papers between 1997 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

Getting the best response for your erg.

Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger

ACM Trans. Algorithms, 2008

Speed Scaling of Tasks with Precedence Constraints.

Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut

Theory Comput. Syst., 2008

Generalization of EDF and LLF: Identifying All Optimal Online Algorithms for Minimizing Maximum Lateness.

Patchrawat Uthaisombut

Algorithmica, 2008

The Online Transportation Problem: On the Exponential Boost of One Extra Server.

Christine Chung, Kirk Pruhs, Patchrawat Uthaisombut

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2005

A Comparison of Multicast Pull Models.

Kirk Pruhs, Patchrawat Uthaisombut

Algorithmica, 2005

2004

The Optimal Online Algorithms for Minimizing Maximum Lateness.

Patchrawat Uthaisombut

Proceedings of the Algorithm Theory, 2004

2003

Dynamic TCP acknowledgment in the LogP model.

Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut

J. Algorithms, 2003

2002

Existence theorems, lower bounds and algorithms for scheduling to meet two objectives.

April Rasala, Clifford Stein, Eric Torng, Patchrawat Uthaisombut

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

The k-Client Problem.

Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, Stephen Wagner

J. Algorithms, 2001

2000

Applying extra-resource analysis to load balancing.

Mark Brehob, Eric Torng, Patchrawat Uthaisombut

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

A Tight Lower Bound for the Best-alpha Algorithm.

Eric Torng, Patchrawat Uthaisombut

Inf. Process. Lett., 1999

Lower Bounds for SRPT-Subsequence Algorithms for Nonpreemptive Scheduling.

Eric Torng, Patchrawat Uthaisombut

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1997

The <i>k</i>-Client Problem.

Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, Stephen Wagner

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997