default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeff Edmonds
- > Home > Persons > Jeff Edmonds
Publications
- 2012
[j19]Jeff Edmonds, Kirk Pruhs:
Scalably scheduling processes with arbitrary speedup curves. ACM Trans. Algorithms 8(3): 28:1-28:10 (2012)- 2011
- [j17]Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam
, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy. Algorithmica 61(3): 507-517 (2011) - [j16]Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs:
Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor. Theory Comput. Syst. 49(4): 817-833 (2011) - [j15]Jeff Edmonds, Kirk Pruhs:
Cake cutting really is not a piece of cake. ACM Trans. Algorithms 7(4): 51:1-51:12 (2011) - 2010
- [i2]Jeff Edmonds, Kirk Pruhs:
Scalably Scheduling Processes with Arbitrary Speedup Curves. Scheduling 2010 - 2009
- [c24]Jeff Edmonds, Kirk Pruhs:
Scalably scheduling processes with arbitrary speedup curves. SODA 2009: 685-692 - [c23]Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs:
Speed scaling of processes with arbitrary speedup curves on a multiprocessor. SPAA 2009: 1-10 - [c22]Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy. STACS 2009: 255-264 - [i1]Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy. CoRR abs/0902.1260 (2009) - 2008
- [c21]Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki:
Confidently Cutting a Cake into Approximately Fair Pieces. AAIM 2008: 155-164 - 2006
- [c19]Jeff Edmonds, Kirk Pruhs:
Balanced Allocations of Cake. FOCS 2006: 623-634 - [c18]Jeff Edmonds, Kirk Pruhs:
Cake cutting really is not a piece of cake. SODA 2006: 271-278 - 2005
- [j12]Jeff Edmonds, Kirk Pruhs:
A maiden analysis of longest wait first. ACM Trans. Algorithms 1(1): 14-32 (2005) - 2004
- [c15]Jeff Edmonds, Kirk Pruhs:
A maiden analysis of Longest Wait First. SODA 2004: 818-827 - 2003
- [j11]Jeff Edmonds, Kirk Pruhs:
Multicast Pull Scheduling: When Fairness Is Fine. Algorithmica 36(3): 315-330 (2003) - 2002
- [c13]Jeff Edmonds, Kirk Pruhs:
Broadcast scheduling: when fairness is fine. SODA 2002: 421-430
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 2024-08-05 21:14 CEST 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:
