| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Kirk Pruhs Jonathan Beaver , Panos K. Chrysanthis , Kirk Pruhs, Vincenzo Liberatore : To Broadcast Push or Not and What?. MDM 2006 : 40 Jeff Edmonds , Kirk Pruhs: Cake cutting really is not a piece of cake. SODA 2006 : 271-278 Nikhil Bansal , Kirk Pruhs: Speed Scaling to Manage Temperature. STACS 2005 : 460-471 Kirk Pruhs, Rob van Stee , Patchrawat Uthaisombut : Speed Scaling of Tasks with Precedence Constraints. WAOA 2005 : 307-319 Mohamed A. Sharaf , Alexandros Labrinidis , Panos K. Chrysanthis , Kirk Pruhs: Freshness-Aware Scheduling of Continuous Queries in the Dynamic Web. WebDB 2005 : 73-78 Jeff Edmonds , Kirk Pruhs: A maiden analysis of longest wait first. ACM Transactions on Algorithms 1 (1): 14-32 (2005) Kirk Pruhs, Patchrawat Uthaisombut : A Comparison of Multicast Pull Models. Algorithmica 42 (3-4): 289-307 (2005) Bala Kalyanasundaram , Kirk Pruhs: Fault-Tolerant Scheduling. SIAM J. Comput. 34 (3): 697-719 (2005) Nikhil Bansal , Tracy Kimbrel , Kirk Pruhs: Dynamic Speed Scaling to Manage Energy and Temperature. FOCS 2004 : 520-529 Jens S. Kohrt , Kirk Pruhs: A Constant Approximation Algorithm for Sorting Buffers. LATIN 2004 : 193-202 Kirk Pruhs, Gerhard J. Woeginger : Approximation Schemes for a Class of Subset Selection Problems. LATIN 2004 : 203-211 Nikhil Bansal , Kirk Pruhs: Server Scheduling in the Weighted l p Norm. LATIN 2004 : 434-443 Jeff Edmonds , Kirk Pruhs: A maiden analysis of Longest Wait First. SODA 2004 : 818-827 Kirk Pruhs, Patchrawat Uthaisombut , Gerhard J. Woeginger : Getting the Best Response for Your Erg. SWAT 2004 : 14-25 Jonathan Beaver , Nicholas Morsillo , Kirk Pruhs, Panos K. Chrysanthis , Vincenzo Liberatore : Scalable Dissemination: What's Hot and What's Not. WebDB 2004 : 31-36 Luca Becchetti , Stefano Leonardi , Alberto Marchetti-Spaccamela , Kirk Pruhs: Semi-clairvoyant scheduling. Theor. Comput. Sci. 324 (2-3): 325-335 (2004) Luca Becchetti , Stefano Leonardi , Alberto Marchetti-Spaccamela , Kirk Pruhs: Semi-clairvoyant Scheduling. ESA 2003 : 67-77 Wei Li , Wenhui Zhang , Vincenzo Liberatore , Vince Penkrot , Jonathan Beaver , Mohamed A. Sharaf , Siddhartha Roychowdhury , Panos K. Chrysanthis , Kirk Pruhs: An Optimized Multicast-based Data Dissemination Middleware. ICDE 2003 : 761-764 Nikhil Bansal , Kirk Pruhs: Server scheduling in the L p norm: a rising tide lifts all boat. STOC 2003 : 242-250 Jeff Edmonds , Kirk Pruhs: Multicast Pull Scheduling: When Fairness Is Fine. Algorithmica 36 (3): 315-330 (2003) Bala Kalyanasundaram , Kirk Pruhs: Minimizing flow time nonclairvoyantly. J. ACM 50 (4): 551-567 (2003) Kirk Pruhs: Foreword. J. Algorithms 48 (1): 1 (2003) Bala Kalyanasundaram , Kirk Pruhs: Maximizing job completions online. J. Algorithms 49 (1): 63-85 (2003) Kirk Pruhs, Bala Kalyanasundaram : Editorial: Special Issue on On-line Scheduling. J. Scheduling 6 (2): 111-112 (2003) Kirk Pruhs, Bala Kalyanasundaram : Editorial: Special Issue on On-Line Scheduling. J. Scheduling 6 (3): 227-228 (2003) Kirk Pruhs: Dedication. J. Scheduling 6 (3): 229 (2003) Kirk Pruhs, Eric Wiewiora : Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation. ALENEX 2002 : 60-70 Kirk Pruhs, Patchrawat Uthaisombut : A Comparison of Multicast Pull Models. ESA 2002 : 808-819 Jeff Edmonds , Kirk Pruhs: Broadcast scheduling: when fairness is fine. SODA 2002 : 421-430 Bala Kalyanasundaram , John Noga , Kirk Pruhs, Gerhard J. Woeginger : Caching for Web Searching. Algorithmica 33 (3): 353-370 (2002) Luca Becchetti , Stefano Leonardi , Alberto Marchetti-Spaccamela , Kirk Pruhs: Online Weighted Flow Time and Deadline Scheduling. RANDOM-APPROX 2001 : 36-47 Alan Berfield , Bill Simons , Panos K. Chrysanthis , Kirk Pruhs: Better client OFF time prediction to improve performance in web information systems. WIDM 2001 : 39-46 Bala Kalyanasundaram , Kirk Pruhs: Eliminating Migration in Multi-processor Scheduling. J. Algorithms 38 (1): 2-24 (2001) Bala Kalyanasundaram , Kirk Pruhs, Mahendran Velauthapillai : Scheduling Broadcasts in Wireless Networks. ESA 2000 : 290-301 Bala Kalyanasundaram , Kirk Pruhs: Dynamic Spectrum Allocation: The Impotency of Duration Notification. FSTTCS 2000 : 421-428 Bala Kalyanasundaram , John Noga , Kirk Pruhs, Gerhard J. Woeginger : Caching for Web Searching. SWAT 2000 : 150-163 Bala Kalyanasundaram , Kirk Pruhs: Fault-Tolerant Real-Time Scheduling. Algorithmica 28 (1): 125-144 (2000) Bala Kalyanasundaram , Kirk Pruhs, Eric Torng : Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks. Algorithmica 28 (3): 269-270 (2000) Bala Kalyanasundaram , Kirk Pruhs: Speed is as powerful as clairvoyance. J. ACM 47 (4): 617-643 (2000) Bala Kalyanasundaram , Kirk Pruhs: The Online Transportation Problem. SIAM J. Discrete Math. 13 (3): 370-383 (2000) Bala Kalyanasundaram , Kirk Pruhs: An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci. 233 (1-2): 319-325 (2000) Bala Kalyanasundaram , Kirk Pruhs: Eliminating Migration in Multi-Processor Scheduling. SODA 1999 : 499-506 Bala Kalyanasundaram , Kirk Pruhs: Maximizing Job Completions Online. ESA 1998 : 235-246 Bala Kalyanasundaram , Kirk Pruhs: Fault-Tolerant Real-Time Scheduling. ESA 1997 : 296-307 Bala Kalyanasundaram , Kirk Pruhs: Minimizing Flow Time Nonclairvoyantly. FOCS 1997 : 345-352 Yossi Azar , Bala Kalyanasundaram , Serge A. Plotkin , Kirk Pruhs, Orli Waarts : On-Line Load Balancing of Temporary Tasks. J. Algorithms 22 (1): 93-110 (1997) Bala Kalyanasundaram , Kirk Pruhs: An Optimal Deterministic Algorithm for Online b-Matching. FSTTCS 1996 : 193-199 Bala Kalyanasundaram , Kirk Pruhs: On-line Network Optimization Problems. Online Algorithms 1996 : 268-280 Bala Kalyanasundaram , Kirk Pruhs: The Online Transportation Problem. ESA 1995 : 484-493 Bala Kalyanasundaram , Kirk Pruhs: Speed is as Powerful as Clairvoyance. FOCS 1995 : 214-221 Kirk Pruhs: Using Local Adaptations to Reconfigure a Spanning Tree of a Network. Discrete Applied Mathematics 57 (1): 67-74 (1995) Bala Kalyanasundaram , Kirk Pruhs: Fault-tolerant scheduling. STOC 1994 : 115-124 Kirk Pruhs: Average-Case Scalable On-Line Algorithms for Fault Replacement. Inf. Process. Lett. 52 (3): 131-136 (1994) Vineet Bafna , Bala Kalyanasundaram , Kirk Pruhs: Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane. Theor. Comput. Sci. 125 (2): 345-360 (1994) Bala Kalyanasundaram , Kirk Pruhs: Constructing Competitive Tours from Local Information. Theor. Comput. Sci. 130 (1): 125-138 (1994) Bala Kalyanasundaram , Kirk Pruhs: Constructing Competitive Tours From Local Information. ICALP 1993 : 102-113 Yossi Azar , Bala Kalyanasundaram , Serge A. Plotkin , Kirk Pruhs, Orli Waarts : Online Load Balancing of Temporary Tasks. WADS 1993 : 119-130 Bala Kalyanasundaram , Kirk Pruhs: A Competitive Analysis of Algorithms for Searching Unknown Scenes. Comput. Geom. 3 : 139-155 (1993) Bala Kalyanasundaram , Kirk Pruhs: Online Weighted Matching. J. Algorithms 14 (3): 478-488 (1993) Bala Kalyanasundaram , Kirk Pruhs: A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version). STACS 1992 : 147-157 Bala Kalyanasundaram , Kirk Pruhs: On-Line Weighted Matching. SODA 1991 : 234-240 Kirk Pruhs, Udi Manber : The Complexity of Controlled Selection Inf. Comput. 91 (1): 103-127 (1991) Kirk Pruhs, Udi Manber : The Complexity of Controlled Selection. ICALP 1989 : 672-686 1 [ 7 ] [ 18 ] 2 [ 10 ] 3 [ 45 ] [ 52 ] [ 55 ] [ 61 ] 4 [ 46 ] [ 49 ] [ 63 ] 5 [ 33 ] [ 47 ] [ 48 ] 6 [ 32 ] 7 [ 32 ] [ 46 ] [ 49 ] [ 59 ] [ 63 ] 8 [ 35 ] [ 44 ] [ 51 ] [ 58 ] [ 62 ] 9 [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 12 ] [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ] [ 20 ] [ 21 ] [ 22 ] [ 23 ] [ 24 ] [ 25 ] [ 26 ] [ 27 ] [ 28 ] [ 29 ] [ 30 ] [ 31 ] [ 34 ] [ 39 ] [ 40 ] [ 41 ] [ 43 ] [ 56 ] 10 [ 55 ] 11 [ 54 ] 12 [ 59 ] 13 [ 33 ] [ 47 ] [ 48 ] 14 [ 46 ] 15 [ 46 ] [ 49 ] [ 63 ] 16 [ 1 ] [ 2 ] 17 [ 33 ] [ 47 ] [ 48 ] 18 [ 49 ] 19 [ 28 ] [ 34 ] 20 [ 46 ] 21 [ 7 ] [ 18 ] 22 [ 46 ] 23 [ 46 ] [ 59 ] 24 [ 32 ] 25 [ 60 ] 26 [ 26 ] 27 [ 36 ] [ 50 ] [ 57 ] [ 60 ] 28 [ 30 ] 29 [ 7 ] [ 18 ] 30 [ 37 ] 31 [ 28 ] [ 34 ] [ 50 ] [ 53 ] 32 [ 46 ]  ©2006 Association for Computing Machinery |
