Speed is as powerful as clairvoyance B Kalyanasundaram, K Pruhs Journal of the ACM (JACM) 47 (4), 617-643, 2000 | 531 | 2000 |
Speed scaling to manage energy and temperature N Bansal, T Kimbrel, K Pruhs Journal of the ACM (JACM) 54 (1), 1-39, 2007 | 429 | 2007 |
Online scheduling. K Pruhs, J Sgall, E Torng Handbook of scheduling, 2004 | 386 | 2004 |
Algorithmic problems in power management S Irani, KR Pruhs ACM Sigact News 36 (2), 63-76, 2005 | 289 | 2005 |
Online weighted matching B Kalyanasundaram, K Pruhs Journal of Algorithms 14 (3), 478-488, 1993 | 284 | 1993 |
Speed is as powerful as clairvoyance [scheduling problems] B Kalyanasundaram, K Pruhs Proceedings of IEEE 36th Annual Foundations of Computer Science, 214-221, 1995 | 232 | 1995 |
An optimal deterministic algorithm for online b-matching B Kalyanasundaram, KR Pruhs Theoretical Computer Science 233 (1-2), 319-325, 2000 | 225 | 2000 |
Dynamic speed scaling to manage energy and temperature N Bansal, T Kimbrel, K Pruhs 45th annual IEEE symposium on foundations of computer science, 520-529, 2004 | 222 | 2004 |
Speed scaling for weighted flow time N Bansal, K Pruhs, C Stein SIAM Journal on Computing 39 (4), 1294-1308, 2010 | 214 | 2010 |
Speed scaling with an arbitrary power function N Bansal, HL Chan, K Pruhs Proceedings of the twentieth annual ACM-SIAM symposium on discrete …, 2009 | 210 | 2009 |
On-line load balancing of temporary tasks Y Azar, B Kalyanasundaram, S Plotkin, KR Pruhs, O Waarts Journal of Algorithms 22 (1), 93-110, 1997 | 166 | 1997 |
Speed scaling of tasks with precedence constraints K Pruhs, R van Stee, P Uthaisombut Theory of Computing Systems 43 (1), 67-80, 2008 | 161 | 2008 |
Constructing competitive tours from local information B Kalyanasundaram, KR Pruhs Theoretical Computer Science 130 (1), 125-138, 1994 | 129 | 1994 |
The geometry of scheduling N Bansal, K Pruhs SIAM Journal on Computing 43 (5), 1684-1698, 2014 | 128 | 2014 |
Getting the best response for your erg K Pruhs, P Uthaisombut, G Woeginger ACM Transactions on Algorithms (TALG) 4 (3), 1-17, 2008 | 123 | 2008 |
Scalably scheduling processes with arbitrary speedup curves J Edmonds, K Pruhs ACM Transactions on Algorithms (TALG) 8 (3), 1-10, 2012 | 106 | 2012 |
KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks M Aly, K Pruhs, PK Chrysanthis Proceedings of the 15th ACM international conference on Information and …, 2006 | 105 | 2006 |
Cake cutting really is not a piece of cake J Edmonds, K Pruhs SODA 6, 271-278, 2006 | 98 | 2006 |
Competitive online scheduling for server systems K Pruhs ACM SIGMETRICS Performance Evaluation Review 34 (4), 52-58, 2007 | 97 | 2007 |
Algorithms and metrics for processing multiple heterogeneous continuous queries MA Sharaf, PK Chrysanthis, A Labrinidis, K Pruhs ACM Transactions on Database Systems (TODS) 33 (1), 1-44, 2008 | 90 | 2008 |