|
| |
These are some of the things I created when I am relaxed.
Introduction / Demo for download
Publications
 | The Online Transportation Problem: On the Exponential Boost of One Extra
Server
 | Christine Chung, Kirk Pruhs, and Patchrawat Uthaisombut. |
| To Appear in Proceedings of LATIN, 2008
|
|
| Real-Time Kinetic Algorithms [ps|pdf|introduction]
| Patchrawat Uthaisombut |
| Submitted for publication
|
|
| Symmetric Rendezvous Search on the Line using Move Patterns with
Different Lengths [ps|pdf]
| Patchrawat Uthaisombut |
| Submitted for publication
|
|
| Speed Scaling of Tasks with Precedence Constraints [ps|pdf]
| Kirk Pruhs, Rob van Stee, and Patchrawat Uthaisombut |
| To appear in Theory of Computing Systems. |
| Speed Scaling of Tasks with Precedence Constraints [ps|pdf]
 | Kirk Pruhs, Rob van Stee, and Patchrawat Uthaisombut |
| In Proceedings of WAOA, pages 307-319, 2005.
|
|
|
| Getting the Best Response for Your Erg [ps|pdf|demo for download]
| Kirk Pruhs, Patchrawat Uthaisombut, and Gerhard Woeginger |
| To appear in ACM Transaction in Algorithms. |
| Preliminary version: Getting the Best Response for Your Erg [ps|pdf|demo for download]
| Kirk Pruhs, Patchrawat Uthaisombut, and Gerhard Woeginger |
| In Lecture Notes in Computer Science: Proceedings of the 9th Scandinavian Workshop on
Algorithm Theory (SWAT), volume 3111/2004, pages 14-25, 2004.
|
|
|
| Generalization of EDF and LLF: identifying all optimal online algorithms
for minimizing maximum lateness [ps|pdf]
| Patchrawat Uthaisombut |
| To appear in Algorithmica. |
| Preliminary version: The Optimal Online Algorithms for Minimizing Maximum Lateness [ps|pdf]
| Patchrawat Uthaisombut |
| In Lecture Notes in Computer Science: Proceedings of the 9th Scandinavian Workshop on
Algorithm Theory (SWAT), volume 3111/2004, pages 420-430, 2004.
|
|
|
| A comparison of
Multicast Pull Models [ps|pdf]
| Kirk Pruhs and Patchrawat Uthaisombut |
| Algorithmica, 42:289-307, June 2005. |
| Preliminary version:
A comparison of
multicast pull models [ps|pdf]
| Kirk Pruhs and Patchrawat Uthaisombut |
| In Lecture Notes in Computer
Science: Proceedings of the 10th
European Symposium on Algorithms (ESA), volume 2461/2002, pages 808-819,
2002.
|
|
|
| Dynamic TCP Acknowledgment in the LogP Model [ps|pdf]
| Jens S. Frederiksen, Kim S. Larsen, John Noga, and Patchrawat
Uthaisombut |
| Journal of Algorithms,
Volume 48, Issue 2, September 2003, Pages 407-428
|
|
| Existence Theorems, Lower Bounds and Algorithms for Scheduling to Meet
Two Objectives [ps]
| April Rasala, Cliff Stein, Eric Torng, and Patchrawat Uthaisombut |
| In Proceedings of the 13th Annual ACM-SIAM
Symposium on Discrete Algorithms (SODA), pages 723-731, 2002.
|
|
| Efficient Algorithms for Mathematical Morphology
| Eric Torng and Patchrawat Uthaisombut |
| Manuscript, 2000.
|
|
| New Directions in Machine Scheduling (abstract,
thesis)
| Patchrawat Uthaisombut |
| Ph.D. Thesis, Computer Science, Michigan State University, 2000 |
| Advisor:
Dr. Eric Torng
|
|
| Applying
Extra-Resource Analysis to Load Balancing [ps|pdf]
| Mark Brehob, Eric Torng, and Patchrawat Uthaisombut |
| Special issue of Journal of Scheduling,
Gerhard Woeginger (editor), pages 273-288, volume 3, issue 5, 2000. |
| Preliminary version:
Applying
Extra-Resource Analysis to Load Balancing [ps]
| Mark Brehob, Eric Torng, and Patchrawat Uthaisombut |
| In Proceedings of the 11th Annual
ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 560-561, 2000.
|
|
|
| A Tight Lower
Bound for the BEST-alpha Algorithm [ps]
| Eric Torng and Patchrawat Uthaisombut |
| Information Processing Letters (IPL),
71(1), 1999, pages 17-22. |
| Preliminary version:
Lower bounds for SRPT-subsequence
algorithms for nonpreemptive scheduling [ps]
| Eric Torng and Patchrawat Uthaisombut |
| In Proceedings of the 10th Annual
ACM-SIAM Symposium on Discrete Algorithms (SODA), pages S973-S974,
1999.
|
|
|
| Paging with
Locality of Reference and Total Access Time [ps]
| Eric Torng and Patchrawat Uthaisombut |
| Manuscript, 1999, 20 pages.
|
|
| The k-client
Problem [ps|pdf]
| Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, and Stephen Wagner |
| Journal of Algorithms 41(2): 115-173,
2001. |
| Preliminary version:
The k-client
Problem [ps]
| Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, and Stephen Wagner |
| In Proceedings of the 8th Annual
ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 73-82, 1997.
|
|
|
| Tissue reflectance and machine vision for automated sweet cherry sorting
| Daniel Guyer, Patchrawat Uthaisombut, and George Stockman |
| In Proceedings of the Society of
Photo-Optical Instrumentation Engineers (SPIE), Volume 2907, pages
152-165, 1996
|
|
| Detecting Defects in Cherries Using Machine Vision (abstract,
thesis (.ps,
.ps.gz))
|
Presentations
| Getting the Best Response for Your Erg
| Kirk Pruhs, Patchrawat Uthaisombut, and Gerhard Woeginger |
| The 9th Scandinavian Workshop on Algorithm Theory (SWAT),
Louisiana Museum of Modern Art, Humlebaek, Denmark, 8-10 July, 2004.
|
|
| The Optimal Online Algorithms for Minimizing Maximum Lateness
| Patchrawat Uthaisombut |
| The 9th Scandinavian Workshop on Algorithm Theory (SWAT),
Louisiana Museum of Modern Art, Humlebaek, Denmark, 8-10 July, 2004.
|
|
| Applying Extra-Resource Analysis to Load Balancing
| Mark Brehob, Eric Torng, and Patchrawat Uthaisombut |
| The 11th Annual ACM-SIAM Symposium on
Discrete Algorithms (SODA), San Francisco, California, Jan 2000.
|
|
| Lower bounds for SRPT-subsequence algorithms for nonpreemptive scheduling
| Eric Torng and Patchrawat Uthaisombut |
| The 10th Annual ACM-SIAM Symposium on
Discrete Algorithms (SODA), Baltimore, Maryland, Jan 1999.
|
|
| The k-client Problem
| Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, and Stephen Wagner |
| Midwest Theory Day, Computer Science Department, Loyola University,
Chicago, IL, Dec, 1997. |
|
|
