Kirk Pruhs

Kirk Pruhs

Auto-generated profile, based on publicly available information

Kirk Pruhs

University of Pittsburgh, Pittsburgh, PA, USA

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 October 2007 in Theory of Computing Systems
Verified
Journal Article
Closed access
PDF file
KPKirk Pruhs
Kirk Pruhs
RSRob van Stee
Rob van Stee
PUPatchrawat Uthaisombut
Patchrawat Uthaisombut

19 December 2016 in Social Choice and Welfare
Verified
Journal Article
Closed access
PDF file
JCJiehua Chen
Jiehua Chen
KPKirk R. Pruhs
Kirk R. Pruhs
GWGerhard J. Woeginger
Gerhard J. Woeginger

20 October 2009 in Journal of Scheduling
Verified
Journal Article
Closed access
PDF file
SBSanjoy Baruah
Sanjoy Baruah
KPKirk Pruhs
Kirk Pruhs

16 December 2009 in Algorithmica
Verified
Journal Article
Closed access
PDF file
NBNikhil Bansal
Nikhil Bansal
DBDavid P. Bunde
David P. Bunde
HCHo-Leung Chan
Ho-Leung Chan
KPKirk Pruhs
Kirk Pruhs

22 June 2010 in Algorithmica
Verified
Journal Article
Open access
PDF file
HCHo-Leung Chan
Ho-Leung Chan
JEJeff Edmonds
Jeff Edmonds
TLTak-Wah Lam
Tak-Wah Lam
Lap-Kei LeeLap-Kei Lee
Lap-Kei Lee
ASAlberto Spaccamela
Alberto Spaccamela
KPKirk Pruhs
Kirk Pruhs
We give three results related to online nonclairvoyant speed scaling to minimize total flow time plus energy. We give a nonclairvoyant algorithm LAPS, and show that for every power function of the form P(s)=s α , LAPS is O(1)-competitive; more precisely, the competitive ratio is 8 for α=2, 13 for α=3, and $\frac{2\alpha^{2}}{\ln\alpha}$ for α>3. We then show that there is no constant c, and no deterministic nonclairvoyant algorithm A, such that A is c-competitive for every power function of the form P(s)=s α . So necessarily the achievable competitive ratio increases as the steepness of the power function increases. Finally we show that there is a fixed, very steep, power function for which no nonclairvoyant algorithm can be O(1)-competitive.

23 April 2015
Verified
Book Chapter
Closed access
PDF file
AAAntonios Antoniadis
Antonios Antoniadis
NBNeal Barcelo
Neal Barcelo
MNMichael Nugent
Michael Nugent
KPKirk Pruhs
Kirk Pruhs
MSMichele Scquizzato
Michele Scquizzato