 | 2009 |
|---|
| 110 |       | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs,
Dmitriy Katz:
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule.
ICALP (1) 2009: 144-155 |
| 109 | | Shenoda Guirguis,
Mohamed A. Sharaf,
Panos K. Chrysanthis,
Alexandros Labrinidis,
Kirk Pruhs:
Adaptive Scheduling of Web Transactions.
ICDE 2009: 357-368 |
| 108 | | Jeff Edmonds,
Kirk Pruhs:
Scalably scheduling processes with arbitrary speedup curves.
SODA 2009: 685-692 |
| 107 | | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Speed scaling with an arbitrary power function.
SODA 2009: 693-701 |
| 106 | | Ho-Leung Chan,
Jeff Edmonds,
Kirk Pruhs:
Speed scaling of processes with arbitrary speedup curves on a multiprocessor.
SPAA 2009: 1-10 |
| 105 | | 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 |
| 104 | | 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) |
| 103 | | Ceyda Oguz,
Kirk Pruhs:
Editorial.
J. Scheduling 12(5): 435-436 (2009) |
| 102 | | Nikhil Bansal,
Kirk Pruhs,
Clifford Stein:
Speed Scaling for Weighted Flow Time.
SIAM J. Comput. 39(4): 1294-1308 (2009) |
| 101 | | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Speed scaling with a solar cell.
Theor. Comput. Sci. 410(45): 4580-4587 (2009) |
| 2008 |
|---|
| 100 |  | Jane W.-S. Liu,
Rolf H. Möhring,
Kirk Pruhs:
Scheduling, 10.02. - 15.02.2008
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
| 99 | | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Speed Scaling with a Solar Cell.
AAIM 2008: 15-26 |
| 98 | | Jeff Edmonds,
Kirk Pruhs,
Jaisingh Solanki:
Confidently Cutting a Cake into Approximately Fair Pieces.
AAIM 2008: 155-164 |
| 97 | | Mohamed A. Sharaf,
Shenoda Guirguis,
Alexandros Labrinidis,
Kirk Pruhs,
Panos K. Chrysanthis:
Poster session: ASETS: A self-managing transaction scheduler.
ICDE Workshops 2008: 56-62 |
| 96 | | Wenhui Zhang,
Vincenzo Liberatore,
Jonathan Beaver,
Panos K. Chrysanthis,
Kirk Pruhs:
Scalable data dissemination using hybrid methods.
IPDPS 2008: 1-12 |
| 95 | | Christine Chung,
Kirk Pruhs,
Patchrawat Uthaisombut:
The Online Transportation Problem: On the Exponential Boost of One Extra Server.
LATIN 2008: 228-239 |
| 94 | | Nikhil Bansal,
David P. Bunde,
Ho-Leung Chan,
Kirk Pruhs:
Average Rate Speed Scaling.
LATIN 2008: 240-251 |
| 93 | | Christine Chung,
Katrina Ligett,
Kirk Pruhs,
Aaron Roth:
The Price of Stochastic Anarchy.
SAGT 2008: 303-314 |
| 92 | | Jane W.-S. Liu,
Rolf H. Möhring,
Kirk Pruhs:
08071 Abstracts Collection -- Scheduling.
Scheduling 2008 |
| 91 | | Jane W.-S. Liu,
Rolf H. Möhring,
Kirk Pruhs:
08071 Executive Summary -- Scheduling.
Scheduling 2008 |
| 90 | | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Flow Time Minimization.
Encyclopedia of Algorithms 2008 |
| 89 | | Kirk Pruhs:
Speed Scaling.
Encyclopedia of Algorithms 2008 |
| 88 | | Mohamed A. Sharaf,
Panos K. Chrysanthis,
Alexandros Labrinidis,
Kirk Pruhs:
Algorithms and metrics for processing multiple heterogeneous continuous queries.
ACM Trans. Database Syst. 33(1): (2008) |
| 87 | | Kirk Pruhs,
Patchrawat Uthaisombut,
Gerhard J. Woeginger:
Getting the best response for your erg.
ACM Transactions on Algorithms 4(3): (2008) |
| 86 | | Kirk Pruhs:
Noam Nisan, Tim Roughgarden, Éva Tardos and Vijay V. Vazirani, Editors, Algorithmic Game Theory, Cambridge University Press (2007) ISBN 9780521872829, 776 pp.
Oper. Res. Lett. 36(5): 656 (2008) |
| 85 | | Kirk Pruhs,
Rob van Stee,
Patchrawat Uthaisombut:
Speed Scaling of Tasks with Precedence Constraints.
Theory Comput. Syst. 43(1): 67-80 (2008) |
| 84 | | Jonathan Beaver,
Kirk Pruhs,
Panos K. Chrysanthis,
Vincenzo Liberatore:
Improving the Hybrid Data Dissemination Model of Web Documents.
World Wide Web 11(3): 313-337 (2008) |
| 2007 |
|---|
| 83 | | Steven J. Brams,
Kirk Pruhs,
Gerhard J. Woeginger:
Fair Division, 24.06. - 29.06.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 82 | | Nikhil Bansal,
Kirk Pruhs,
Clifford Stein:
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007
SIAM 2007 |
| 81 | | Nikhil Bansal,
Ho-Leung Chan,
Rohit Khandekar,
Kirk Pruhs,
Clifford Stein,
Baruch Schieber:
Non-Preemptive Min-Sum Scheduling with Resource Augmentation.
FOCS 2007: 614-624 |
| 80 | | Steven J. Brams,
Kirk Pruhs:
07261 Abstracts Collection -- Fair Division.
Fair Division 2007 |
| 79 | | Steven J. Brams,
Kirk Pruhs:
07261 Summary -- Fair Division.
Fair Division 2007 |
| 78 | | Nikhil Bansal,
Ho-Leung Chan,
Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling.
ICALP 2007: 28-39 |
| 77 | | Nikhil Bansal,
Kirk Pruhs,
Clifford Stein:
Speed scaling for weighted flow time.
SODA 2007: 805-813 |
| 76 | | Nikhil Bansal,
Tracy Kimbrel,
Kirk Pruhs:
Speed scaling to manage energy and temperature.
J. ACM 54(1): (2007) |
| 75 | | Kirk Pruhs:
Competitive online scheduling for server systems.
SIGMETRICS Performance Evaluation Review 34(4): 52-58 (2007) |
| 74 | | Kirk Pruhs,
Gerhard J. Woeginger:
Approximation schemes for a class of subset selection problems.
Theor. Comput. Sci. 382(2): 151-156 (2007) |
| 2006 |
|---|
| 73 | | Mohamed Aly,
Kirk Pruhs,
Panos K. Chrysanthis:
KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks.
CIKM 2006: 317-326 |
| 72 | | Daniel Mossé,
Louise Comfort,
Ahmed Amer,
José Carlos Brustoloni,
Panos K. Chrysanthis,
Milos Hauskrecht,
Alexandros Labrinidis,
Rami G. Melhem,
Kirk Pruhs:
Secure-CITI Critical Information-Technology Infrastructure.
DG.O 2006: 253-254 |
| 71 | | Jeff Edmonds,
Kirk Pruhs:
Balanced Allocations of Cake.
FOCS 2006: 623-634 |
| 70 | | Jonathan Beaver,
Panos K. Chrysanthis,
Kirk Pruhs,
Vincenzo Liberatore:
To Broadcast Push or Not and What?.
MDM 2006: 40 |
| 69 | | Jeff Edmonds,
Kirk Pruhs:
Cake cutting really is not a piece of cake.
SODA 2006: 271-278 |
| 68 | | Mohamed A. Sharaf,
Panos K. Chrysanthis,
Alexandros Labrinidis,
Kirk Pruhs:
Efficient Scheduling of Heterogeneous Continuous Queries.
VLDB 2006: 511-522 |
| 67 | | Ahmad T. Al-Hammouri,
Wenhui Zhang,
Robert F. Buchheit,
Vincenzo Liberatore,
Panos K. Chrysanthis,
Kirk Pruhs:
Network awareness and application adaptability.
Inf. Syst. E-Business Management 4(4): 399-419 (2006) |
| 66 | | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Online weighted flow time and deadline scheduling.
J. Discrete Algorithms 4(3): 339-352 (2006) |
| 2005 |
|---|
| 65 | | Mohamed Aly,
Nicholas Morsillo,
Panos K. Chrysanthis,
Kirk Pruhs:
Zone sharing: a hot-spots decomposition scheme for data-centric storage in sensor networks.
DMSN 2005: 21-26 |
| 64 | | Nikhil Bansal,
Kirk Pruhs:
Speed Scaling to Manage Temperature.
STACS 2005: 460-471 |
| 63 | | Kirk Pruhs,
Rob van Stee,
Patchrawat Uthaisombut:
Speed Scaling of Tasks with Precedence Constraints.
WAOA 2005: 307-319 |
| 62 | | Mohamed A. Sharaf,
Alexandros Labrinidis,
Panos K. Chrysanthis,
Kirk Pruhs:
Freshness-Aware Scheduling of Continuous Queries in the Dynamic Web.
WebDB 2005: 73-78 |
| 61 | | Jeff Edmonds,
Kirk Pruhs:
A maiden analysis of longest wait first.
ACM Transactions on Algorithms 1(1): 14-32 (2005) |
| 60 | | Kirk Pruhs,
Patchrawat Uthaisombut:
A Comparison of Multicast Pull Models.
Algorithmica 42(3-4): 289-307 (2005) |
| 59 | | Bala Kalyanasundaram,
Kirk Pruhs:
Fault-Tolerant Scheduling.
SIAM J. Comput. 34(3): 697-719 (2005) |
| 58 | | Sandy Irani,
Kirk Pruhs:
Algorithmic problems in power management.
SIGACT News 36(2): 63-76 (2005) |
| 2004 |
|---|
| 57 | | Nikhil Bansal,
Tracy Kimbrel,
Kirk Pruhs:
Dynamic Speed Scaling to Manage Energy and Temperature.
FOCS 2004: 520-529 |
| 56 | | Jens S. Kohrt,
Kirk Pruhs:
A Constant Approximation Algorithm for Sorting Buffers.
LATIN 2004: 193-202 |
| 55 | | Kirk Pruhs,
Gerhard J. Woeginger:
Approximation Schemes for a Class of Subset Selection Problems.
LATIN 2004: 203-211 |
| 54 | | Nikhil Bansal,
Kirk Pruhs:
Server Scheduling in the Weighted lp Norm.
LATIN 2004: 434-443 |
| 53 | | Jeff Edmonds,
Kirk Pruhs:
A maiden analysis of Longest Wait First.
SODA 2004: 818-827 |
| 52 | | Kirk Pruhs,
Patchrawat Uthaisombut,
Gerhard J. Woeginger:
Getting the Best Response for Your Erg.
SWAT 2004: 14-25 |
| 51 | | Jonathan Beaver,
Nicholas Morsillo,
Kirk Pruhs,
Panos K. Chrysanthis,
Vincenzo Liberatore:
Scalable Dissemination: What's Hot and What's Not.
WebDB 2004: 31-36 |
| 50 | | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Semi-clairvoyant scheduling.
Theor. Comput. Sci. 324(2-3): 325-335 (2004) |
| 2003 |
|---|
| 49 | | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Semi-clairvoyant Scheduling.
ESA 2003: 67-77 |
| 48 | | 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: 762-764 |
| 47 | | Nikhil Bansal,
Kirk Pruhs:
Server scheduling in the Lp norm: a rising tide lifts all boat.
STOC 2003: 242-250 |
| 46 | | Panos K. Chrysanthis,
Vincenzo Liberatore,
Kirk Pruhs:
Middleware Support for Multicast-based Data Dissemination: A Working Reality.
WORDS 2003: 265-272 |
| 45 | | Jeff Edmonds,
Kirk Pruhs:
Multicast Pull Scheduling: When Fairness Is Fine.
Algorithmica 36(3): 315-330 (2003) |
| 44 | | Bala Kalyanasundaram,
Kirk Pruhs:
Minimizing flow time nonclairvoyantly.
J. ACM 50(4): 551-567 (2003) |
| 43 | | Kirk Pruhs:
Foreword.
J. Algorithms 48(1): 1 (2003) |
| 42 | | Bala Kalyanasundaram,
Kirk Pruhs:
Maximizing job completions online.
J. Algorithms 49(1): 63-85 (2003) |
| 41 | | Kirk Pruhs,
Bala Kalyanasundaram:
Editorial: Special Issue on On-line Scheduling.
J. Scheduling 6(2): 111-112 (2003) |
| 40 | | Kirk Pruhs,
Bala Kalyanasundaram:
Editorial: Special Issue on On-Line Scheduling.
J. Scheduling 6(3): 227-228 (2003) |
| 39 | | Kirk Pruhs:
Dedication.
J. Scheduling 6(3): 229 (2003) |
| 2002 |
|---|
| 38 | | Kirk Pruhs,
Eric Wiewiora:
Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation.
ALENEX 2002: 60-70 |
| 37 | | Kirk Pruhs,
Patchrawat Uthaisombut:
A Comparison of Multicast Pull Models.
ESA 2002: 808-819 |
| 36 | | Jeff Edmonds,
Kirk Pruhs:
Broadcast scheduling: when fairness is fine.
SODA 2002: 421-430 |
| 35 | | Bala Kalyanasundaram,
John Noga,
Kirk Pruhs,
Gerhard J. Woeginger:
Caching for Web Searching.
Algorithmica 33(3): 353-370 (2002) |
| 2001 |
|---|
| 34 | | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Online Weighted Flow Time and Deadline Scheduling.
RANDOM-APPROX 2001: 36-47 |
| 33 | | 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 |
| 32 | | Bala Kalyanasundaram,
Kirk Pruhs:
Eliminating Migration in Multi-processor Scheduling.
J. Algorithms 38(1): 2-24 (2001) |
| 2000 |
|---|
| 31 | | Bala Kalyanasundaram,
Kirk Pruhs,
Mahendran Velauthapillai:
Scheduling Broadcasts in Wireless Networks.
ESA 2000: 290-301 |
| 30 | | Bala Kalyanasundaram,
Kirk Pruhs:
Dynamic Spectrum Allocation: The Impotency of Duration Notification.
FSTTCS 2000: 421-428 |
| 29 | | Bala Kalyanasundaram,
John Noga,
Kirk Pruhs,
Gerhard J. Woeginger:
Caching for Web Searching.
SWAT 2000: 150-163 |
| 28 | | Bala Kalyanasundaram,
Kirk Pruhs:
Fault-Tolerant Real-Time Scheduling.
Algorithmica 28(1): 125-144 (2000) |
| 27 | | Bala Kalyanasundaram,
Kirk Pruhs,
Eric Torng:
Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks.
Algorithmica 28(3): 269-270 (2000) |
| 26 | | Bala Kalyanasundaram,
Kirk Pruhs:
Speed is as powerful as clairvoyance.
J. ACM 47(4): 617-643 (2000) |
| 25 | | Bala Kalyanasundaram,
Kirk Pruhs:
The Online Transportation Problem.
SIAM J. Discrete Math. 13(3): 370-383 (2000) |
| 24 | | Bala Kalyanasundaram,
Kirk Pruhs:
An optimal deterministic algorithm for online b-matching.
Theor. Comput. Sci. 233(1-2): 319-325 (2000) |
| 1999 |
|---|
| 23 | | Bala Kalyanasundaram,
Kirk Pruhs:
Eliminating Migration in Multi-Processor Scheduling.
SODA 1999: 499-506 |
| 1998 |
|---|
| 22 | | Bala Kalyanasundaram,
Kirk Pruhs:
Maximizing Job Completions Online.
ESA 1998: 235-246 |
| 21 | | Kirk Pruhs:
How to design dynamic programming algorithms sans recursion.
SIGACT News 29(1): 32-35 (1998) |
| 1997 |
|---|
| 20 | | Bala Kalyanasundaram,
Kirk Pruhs:
Fault-Tolerant Real-Time Scheduling.
ESA 1997: 296-307 |
| 19 | | Bala Kalyanasundaram,
Kirk Pruhs:
Minimizing Flow Time Nonclairvoyantly.
FOCS 1997: 345-352 |
| 18 | | 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) |
| 1996 |
|---|
| 17 | | Bala Kalyanasundaram,
Kirk Pruhs:
An Optimal Deterministic Algorithm for Online b-Matching.
FSTTCS 1996: 193-199 |
| 16 | | Bala Kalyanasundaram,
Kirk Pruhs:
On-line Network Optimization Problems.
Online Algorithms 1996: 268-280 |
| 1995 |
|---|
| 15 | | Bala Kalyanasundaram,
Kirk Pruhs:
The Online Transportation Problem.
ESA 1995: 484-493 |
| 14 | | Bala Kalyanasundaram,
Kirk Pruhs:
Speed is as Powerful as Clairvoyance.
FOCS 1995: 214-221 |
| 13 | | Kirk Pruhs:
Using Local Adaptations to Reconfigure a Spanning Tree of a Network.
Discrete Applied Mathematics 57(1): 67-74 (1995) |
| 1994 |
|---|
| 12 | | Bala Kalyanasundaram,
Kirk Pruhs:
Fault-tolerant scheduling.
STOC 1994: 115-124 |
| 11 | | Kirk Pruhs:
Average-Case Scalable On-Line Algorithms for Fault Replacement.
Inf. Process. Lett. 52(3): 131-136 (1994) |
| 10 | | 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) |
| 9 | | Bala Kalyanasundaram,
Kirk Pruhs:
Constructing Competitive Tours from Local Information.
Theor. Comput. Sci. 130(1): 125-138 (1994) |
| 1993 |
|---|
| 8 | | Bala Kalyanasundaram,
Kirk Pruhs:
Constructing Competitive Tours From Local Information.
ICALP 1993: 102-113 |
| 7 | | Yossi Azar,
Bala Kalyanasundaram,
Serge A. Plotkin,
Kirk Pruhs,
Orli Waarts:
Online Load Balancing of Temporary Tasks.
WADS 1993: 119-130 |
| 6 | | Bala Kalyanasundaram,
Kirk Pruhs:
A Competitive Analysis of Algorithms for Searching Unknown Scenes.
Comput. Geom. 3: 139-155 (1993) |
| 5 | | Bala Kalyanasundaram,
Kirk Pruhs:
Online Weighted Matching.
J. Algorithms 14(3): 478-488 (1993) |
| 1992 |
|---|
| 4 | | Bala Kalyanasundaram,
Kirk Pruhs:
A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version).
STACS 1992: 147-157 |
| 1991 |
|---|
| 3 | | Bala Kalyanasundaram,
Kirk Pruhs:
On-Line Weighted Matching.
SODA 1991: 234-240 |
| 2 | | Kirk Pruhs,
Udi Manber:
The Complexity of Controlled Selection
Inf. Comput. 91(1): 103-127 (1991) |
| 1989 |
|---|
| 1 | | Kirk Pruhs,
Udi Manber:
The Complexity of Controlled Selection.
ICALP 1989: 672-686 |
