Kirk Pruhs
Affiliations: | University of Pittsburgh, Pittsburgh, PA, United States |
Area:
Computer ScienceGoogle:
"Kirk Pruhs"
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Kaklamanis C, Pruhs K. (2016) Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms Theory of Computing Systems. 58: 1-3 |
Antoniadis A, Barcelo N, Nugent M, et al. (2016) Chasing convex bodies and functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9644: 68-81 |
Im S, Moseley B, Pruhs K. (2015) Stochastic scheduling of heavy-tailed jobs Leibniz International Proceedings in Informatics, Lipics. 30: 474-486 |
Bansal N, Gupta A, Krishnaswamy R, et al. (2015) A 2-competitive algorithm for online convex optimization with switching costs Leibniz International Proceedings in Informatics, Lipics. 40: 96-109 |
Barcelo N, Kling P, Nugent M, et al. (2015) On the complexity of speed scaling Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9235: 75-89 |
Antoniadis A, Barcelo N, Nugent M, et al. (2015) A o(n)-competitive deterministic algorithm for online matching on a line Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8952: 11-22 |
Antoniadis A, Barcelo N, Consuegra M, et al. (2014) Efficient computation of optimal energy and fractional weighted flow trade-off schedules Leibniz International Proceedings in Informatics, Lipics. 25: 63-74 |
Im S, Moseley B, Pruhs K, et al. (2014) Competitively scheduling tasks with intermediate parallelizability Annual Acm Symposium On Parallelism in Algorithms and Architectures. 22-29 |
Krishnaswamy R, Nagarajan V, Pruhs K, et al. (2014) Cluster before you hallucinate: Approximating node-capacitated network design and energy efficient routing Proceedings of the Annual Acm Symposium On Theory of Computing. 734-743 |
Im. S, Moseley B, Pruhs K. (2014) Online scheduling with general cost functions Siam Journal On Computing. 43: 126-143 |