☰

Patchrawat Uthaisombut, Ph.D. - Publications

Affiliations: 
2000 Michigan State University, East Lansing, MI 
Area:
Computer Science, Mathematics, Transportation
Tree Info Similar researchers PubMed Report error

13 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2008 Uthaisombut P. Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness Algorithmica (New York). 50: 312-328. DOI: 10.1007/s00453-007-9083-9  0.544
2008 Pruhs K, Van Stee R, Uthaisombut P. Speed scaling of tasks with precedence constraints Theory of Computing Systems. 43: 67-80. DOI: 10.1007/S00224-007-9070-1  0.399
2008 Chung C, Pruhs K, Uthaisombut P. The online transportation problem: On the exponential boost of one extra server Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4957: 228-239.  0.418
2004 Pruhs K, Uthaisombut P, Woeginger G. Getting the best response for your erg Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3111: 14-25. DOI: 10.1145/1367064.1367078  0.457
2004 Uthaisombut P. The optimal online algorithms for minimizing maximum lateness Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3111: 420-430.  0.546
2004 Pruhs K, Uthaisombut P, Woeginger G. Getting the best response for your erg Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3111: 14-25.  0.38
2003 Frederiksen JS, Larsen KS, Noga J, Uthaisombut P. Dynamic TCP acknowledgment in the LogP model Journal of Algorithms. 48: 407-428. DOI: 10.1016/S0196-6774(03)00058-0  0.42
2002 Pruhs K, Uthaisombut P. A comparison of multicast pull models Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2461: 808-819. DOI: 10.1007/S00453-005-1170-1  0.304
2002 Rasala A, Stein C, Torng E, Uthaisombut P. Existence theorems, lower bounds and algorithms for scheduling to meet two objectives Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 6: 723-731.  0.575
2001 Alborzi H, Torng E, Uthaisombut P, Wagner S. The k-Client Problem Journal of Algorithms. 41: 115-173. DOI: 10.1006/Jagm.2001.1182  0.598
2000 Brehob M, Torng E, Uthaisombut P. Applying extra‐resource analysis to load balancing Journal of Scheduling. 3: 273-288. DOI: 10.1002/1099-1425(200009/10)3:5<273::Aid-Jos48>3.0.Co;2-0  0.644
2000 Brehob M, Torng E, Uthaisombut P. Applying extra-resource analysis to load balancing Journal of Scheduling. 3: 273-288.  0.653
1999 Torng E, Uthaisombut P. A tight lower bound for the best-α algorithm Information Processing Letters. 71: 17-22. DOI: 10.1016/S0020-0190(99)00082-4  0.602
Show low-probability matches.