default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatchrawat Uthaisombut
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j7]Patchrawat Uthaisombut:
Generalization of EDF and LLF: Identifying All Optimal Online Algorithms for Minimizing Maximum Lateness. Algorithmica 50(3): 312-328 (2008)- [j6]Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut:
Speed Scaling of Tasks with Precedence Constraints. Theory Comput. Syst. 43(1): 67-80 (2008) - [j5]Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger:
Getting the best response for your erg. ACM Trans. Algorithms 4(3): 38:1-38:17 (2008) - [c9]Christine Chung, Kirk Pruhs, Patchrawat Uthaisombut:
The Online Transportation Problem: On the Exponential Boost of One Extra Server. LATIN 2008: 228-239 - 2005
- [j4]Kirk Pruhs, Patchrawat Uthaisombut:
A Comparison of Multicast Pull Models. Algorithmica 42(3-4): 289-307 (2005) - [c8]Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut:
Speed Scaling of Tasks with Precedence Constraints. WAOA 2005: 307-319 - 2004
- [c7]Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger:
Getting the Best Response for Your Erg. SWAT 2004: 14-25 - [c6]Patchrawat Uthaisombut:
The Optimal Online Algorithms for Minimizing Maximum Lateness. SWAT 2004: 420-430 - 2003
- [j3]Jens S. Frederiksen, Kim S. Larsen
, John Noga, Patchrawat Uthaisombut:
Dynamic TCP acknowledgment in the LogP model. J. Algorithms 48(2): 407-428 (2003) - 2002
- [c5]Kirk Pruhs, Patchrawat Uthaisombut:
A Comparison of Multicast Pull Models. ESA 2002: 808-819 - [c4]April Rasala, Clifford Stein, Eric Torng, Patchrawat Uthaisombut:
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. SODA 2002: 723-731 - 2001
- [j2]Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, Stephen Wagner:
The k-Client Problem. J. Algorithms 41(2): 115-173 (2001) - 2000
- [c3]Mark Brehob, Eric Torng, Patchrawat Uthaisombut:
Applying extra-resource analysis to load balancing. SODA 2000: 560-561
1990 – 1999
- 1999
- [j1]Eric Torng, Patchrawat Uthaisombut:
A Tight Lower Bound for the Best-alpha Algorithm. Inf. Process. Lett. 71(1): 17-22 (1999) - [c2]Eric Torng, Patchrawat Uthaisombut:
Lower Bounds for SRPT-Subsequence Algorithms for Nonpreemptive Scheduling. SODA 1999: 973-974 - 1997
- [c1]Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, Stephen Wagner:
The k-Client Problem. SODA 1997: 73-82
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
