Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Kirk Pruhs
2010 – today
- 2013
[j55]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Speed Scaling with an Arbitrary Power Function. ACM Transactions on Algorithms 9(2): 18 (2013)- [c84]Benjamin Moseley, Kirk Pruhs, Cliff Stein: The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract). IPCO 2013: 278-289
- [i7]Benjamin Moseley, Kirk Pruhs, Cliff Stein: The Complexity of Scheduling for p-norms of Flow and Stretch. CoRR abs/1301.0793 (2013)
- [i6]Ahmed Abousamra, David P. Bunde, Kirk Pruhs: An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints. CoRR abs/1307.0531 (2013)
- [i5]Susanne Albers, Onno J. Boxma, Kirk Pruhs: Scheduling (Dagstuhl Seminar 13111). Dagstuhl Reports 3(3): 24-50 (2013)
- 2012
- [j54]Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth: The Power of Fair Pricing Mechanisms. Algorithmica 63(3): 634-644 (2012)
- [j53]Lory Al Moakar, Panos K. Chrysanthis, Christine Chung, Shenoda Guirguis, Alexandros Labrinidis, Panayiotis Neophytou, Kirk Pruhs: Auction-based Admission Control for Continuous Queries in a Multi-Tenant DSMS. IJNGC 3(3) (2012)
- [j52]Daniel Cole, Sungjin Im, Benjamin Moseley, Kirk Pruhs: Speed scaling for stretch plus energy. Oper. Res. Lett. 40(3): 180-184 (2012)
- [j51]Jeff Edmonds, Kirk Pruhs: Scalably scheduling processes with arbitrary speedup curves. ACM Transactions on Algorithms 8(3): 28 (2012)
- [j50]Nikhil Bansal, Ho-Leung Chan, Dmitriy Katz, Kirk Pruhs: Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. Theory of Computing 8(1): 209-229 (2012)
- [c83]Nikhil Bansal, Kirk Pruhs: Weighted Geometric Set Multi-cover via Quasi-uniform Sampling. ESA 2012: 145-156
- [c82]
- [c81]Daniel Cole, Dimitrios Letsios, Michael Nugent, Kirk Pruhs: Optimal energy trade-off schedules. IGCC 2012: 1-10
- [c80]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein: Multicast Routing for Energy Minimization Using Speed Scaling. MedAlg 2012: 37-51
- [c79]Neal Barcelo, Miao Zhou, Daniel Cole, Michael Nugent, Kirk Pruhs: Energy Efficient Caching for Phase-Change Memory. MedAlg 2012: 67-81
- [c78]Neal Barcelo, Sungjin Im, Benjamin Moseley, Kirk Pruhs: Shortest-Elapsed-Time-First on a Multiprocessor. MedAlg 2012: 82-92
- [c77]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs: Scheduling heterogeneous processors isn't as easy as you think. SODA 2012: 1242-1253
- [c76]Sungjin Im, Benjamin Moseley, Kirk Pruhs: Online scheduling with general cost functions. SODA 2012: 1254-1265
- [c75]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. WAOA 2012: 173-186
- 2011
- [j49]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Competitive Algorithms for Due Date Scheduling. Algorithmica 59(4): 569-582 (2011)
- [j48]Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs: Average Rate Speed Scaling. Algorithmica 60(4): 877-889 (2011)
- [j47]Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs: Nonclairvoyant Speed Scaling for Flow and Energy. Algorithmica 61(3): 507-517 (2011)
- [j46]Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs: Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor. Theory Comput. Syst. 49(4): 817-833 (2011)
- [j45]Sungjin Im, Benjamin Moseley, Kirk Pruhs: A tutorial on amortized local competitiveness in online scheduling. SIGACT News 42(2): 83-97 (2011)
- [j44]Jeff Edmonds, Kirk Pruhs: Cake cutting really is not a piece of cake. ACM Transactions on Algorithms 7(4): 51 (2011)
- [c74]
- [c73]
- [c72]Leon Atkins, Guillaume Aupy, Daniel Cole, Kirk Pruhs: Speed Scaling to Manage Temperature. TAPAS 2011: 9-20
- [i4]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Scalably Scheduling Power-Heterogeneous Processors. CoRR abs/1105.3748 (2011)
- [i3]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling. CoRR abs/1109.5931 (2011)
- 2010
- [j43]Sanjoy K. Baruah, Kirk Pruhs: Open problems in real-time scheduling. J. Scheduling 13(6): 577-582 (2010)
- [j42]Nikhil Bansal, Kirk Pruhs: Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service. SIAM J. Comput. 39(7): 3311-3335 (2010)
- [c71]Kirk Pruhs, Clifford Stein: How to Schedule When You Have to Buy Your Energy. APPROX-RANDOM 2010: 352-365
- [c70]
- [c69]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Nonclairvoyantly scheduling power-heterogeneous processors. Green Computing Conference 2010: 165-173
- [c68]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Scalably Scheduling Power-Heterogeneous Processors. ICALP (1) 2010: 312-323
- [c67]Lory Al Moakar, Panos K. Chrysanthis, Christine Chung, Shenoda Guirguis, Alexandros Labrinidis, Panayiotis Neophytou, Kirk Pruhs: Admission control mechanisms for continuous queries in the cloud. ICDE 2010: 409-412
- [c66]Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth: The Power of Fair Pricing Mechanisms. LATIN 2010: 554-564
- [c65]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs: Scheduling jobs with varying parallelizability to reduce variance. SPAA 2010: 11-20
- [c64]Kirk Pruhs, Julien Robert, Nicolas Schabanel: Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability. WAOA 2010: 237-248
- [i2]
2000 – 2009
- 2009
- [j41]
- [j40]Nikhil Bansal, Kirk Pruhs, Clifford Stein: Speed Scaling for Weighted Flow Time. SIAM J. Comput. 39(4): 1294-1308 (2009)
- [j39]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Speed scaling with a solar cell. Theor. Comput. Sci. 410(45): 4580-4587 (2009)
- [c63]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
- [c62]Shenoda Guirguis, Mohamed A. Sharaf, Panos K. Chrysanthis, Alexandros Labrinidis, Kirk Pruhs: Adaptive Scheduling of Web Transactions. ICDE 2009: 357-368
- [c61]Jeff Edmonds, Kirk Pruhs: Scalably scheduling processes with arbitrary speedup curves. SODA 2009: 685-692
- [c60]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Speed scaling with an arbitrary power function. SODA 2009: 693-701
- [c59]Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs: Speed scaling of processes with arbitrary speedup curves on a multiprocessor. SPAA 2009: 1-10
- [c58]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
- [i1]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)
- 2008
- [j38]Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut: Speed Scaling of Tasks with Precedence Constraints. Theory Comput. Syst. 43(1): 67-80 (2008)
- [j37]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)
- [j36]Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger: Getting the best response for your erg. ACM Transactions on Algorithms 4(3) (2008)
- [j35]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)
- [j34]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)
- [c57]
- [c56]Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki: Confidently Cutting a Cake into Approximately Fair Pieces. AAIM 2008: 155-164
- [c55]
- [c54]Jane W.-S. Liu, Rolf H. Möhring, Kirk Pruhs: 08071 Abstracts Collection -- Scheduling. Scheduling 2008
- [c53]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
- [c52]Wenhui Zhang, Vincenzo Liberatore, Jonathan Beaver, Panos K. Chrysanthis, Kirk Pruhs: Scalable data dissemination using hybrid methods. IPDPS 2008: 1-12
- [c51]Christine Chung, Kirk Pruhs, Patchrawat Uthaisombut: The Online Transportation Problem: On the Exponential Boost of One Extra Server. LATIN 2008: 228-239
- [c50]Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs: Average Rate Speed Scaling. LATIN 2008: 240-251
- [c49]Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth: The Price of Stochastic Anarchy. SAGT 2008: 303-314
- [e3]Jane W.-S. Liu, Rolf H. Möhring, Kirk Pruhs (Eds.): Scheduling, 10.02. - 15.02.2008. Dagstuhl Seminar Proceedings 08071, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
- [r2]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Flow Time Minimization. Encyclopedia of Algorithms 2008
- [r1]
- 2007
- [j33]Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs: Speed scaling to manage energy and temperature. J. ACM 54(1) (2007)
- [j32]Kirk Pruhs: Competitive online scheduling for server systems. SIGMETRICS Performance Evaluation Review 34(4): 52-58 (2007)
- [j31]Kirk Pruhs, Gerhard J. Woeginger: Approximation schemes for a class of subset selection problems. Theor. Comput. Sci. 382(2): 151-156 (2007)
- [c48]
- [c47]
- [c46]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
- [c45]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Competitive Algorithms for Due Date Scheduling. ICALP 2007: 28-39
- [c44]
- [e2]Steven J. Brams, Kirk Pruhs, Gerhard J. Woeginger (Eds.): Fair Division, 24.06. - 29.06.2007. Dagstuhl Seminar Proceedings 07261, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
- [e1]Nikhil Bansal, Kirk Pruhs, Clifford Stein (Eds.): Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. SIAM 2007, ISBN 978-0-898716-24-5
- 2006
- [j30]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)
- [j29]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Online weighted flow time and deadline scheduling. J. Discrete Algorithms 4(3): 339-352 (2006)
- [c43]Mohamed Aly, Kirk Pruhs, Panos K. Chrysanthis: KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks. CIKM 2006: 317-326
- [c42]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
- [c41]
- [c40]Jonathan Beaver, Panos K. Chrysanthis, Kirk Pruhs, Vincenzo Liberatore: To Broadcast Push or Not and What?. MDM 2006: 40
- [c39]
- [c38]Mohamed A. Sharaf, Panos K. Chrysanthis, Alexandros Labrinidis, Kirk Pruhs: Efficient Scheduling of Heterogeneous Continuous Queries. VLDB 2006: 511-522
- 2005
- [j28]Kirk Pruhs, Patchrawat Uthaisombut: A Comparison of Multicast Pull Models. Algorithmica 42(3-4): 289-307 (2005)
- [j27]
- [j26]
- [j25]Jeff Edmonds, Kirk Pruhs: A maiden analysis of longest wait first. ACM Transactions on Algorithms 1(1): 14-32 (2005)
- [c37]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
- [c36]
- [c35]Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut: Speed Scaling of Tasks with Precedence Constraints. WAOA 2005: 307-319
- [c34]Mohamed A. Sharaf, Alexandros Labrinidis, Panos K. Chrysanthis, Kirk Pruhs: Freshness-Aware Scheduling of Continuous Queries in the Dynamic Web. WebDB 2005: 73-78
- 2004
- [j24]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Semi-clairvoyant scheduling. Theor. Comput. Sci. 324(2-3): 325-335 (2004)
- [c33]Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs: Dynamic Speed Scaling to Manage Energy and Temperature. FOCS 2004: 520-529
- [c32]Jens S. Kohrt, Kirk Pruhs: A Constant Approximation Algorithm for Sorting Buffers. LATIN 2004: 193-202
- [c31]Kirk Pruhs, Gerhard J. Woeginger: Approximation Schemes for a Class of Subset Selection Problems. LATIN 2004: 203-211
- [c30]
- [c29]
- [c28]Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger: Getting the Best Response for Your Erg. SWAT 2004: 14-25
- [c27]Jonathan Beaver, Nicholas Morsillo, Kirk Pruhs, Panos K. Chrysanthis, Vincenzo Liberatore: Scalable Dissemination: What's Hot and What's Not. WebDB 2004: 31-36
- 2003
- [j23]Jeff Edmonds, Kirk Pruhs: Multicast Pull Scheduling: When Fairness Is Fine. Algorithmica 36(3): 315-330 (2003)
- [j22]Bala Kalyanasundaram, Kirk Pruhs: Minimizing flow time nonclairvoyantly. J. ACM 50(4): 551-567 (2003)
- [j21]
- [j20]Bala Kalyanasundaram, Kirk Pruhs: Maximizing job completions online. J. Algorithms 49(1): 63-85 (2003)
- [j19]Kirk Pruhs, Bala Kalyanasundaram: Editorial: Special Issue on On-line Scheduling. J. Scheduling 6(2): 111-112 (2003)
- [j18]Kirk Pruhs, Bala Kalyanasundaram: Editorial: Special Issue on On-Line Scheduling. J. Scheduling 6(3): 227-228 (2003)
- [j17]
- [c26]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Semi-clairvoyant Scheduling. ESA 2003: 67-77
- [c25]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
- [c24]Nikhil Bansal, Kirk Pruhs: Server scheduling in the Lp norm: a rising tide lifts all boat. STOC 2003: 242-250
- [c23]Panos K. Chrysanthis, Vincenzo Liberatore, Kirk Pruhs: Middleware Support for Multicast-based Data Dissemination: A Working Reality. WORDS 2003: 265-272
- 2002
- [j16]Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger: Caching for Web Searching. Algorithmica 33(3): 353-370 (2002)
- [c22]Kirk Pruhs, Eric Wiewiora: Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation. ALENEX 2002: 60-70
- [c21]
- [c20]
- 2001
- [j15]Bala Kalyanasundaram, Kirk Pruhs: Eliminating Migration in Multi-processor Scheduling. J. Algorithms 38(1): 2-24 (2001)
- [c19]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Online Weighted Flow Time and Deadline Scheduling. RANDOM-APPROX 2001: 36-47
- [c18]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
- 2000
- [j14]Bala Kalyanasundaram, Kirk Pruhs: Fault-Tolerant Real-Time Scheduling. Algorithmica 28(1): 125-144 (2000)
- [j13]Bala Kalyanasundaram, Kirk Pruhs, Eric Torng: Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks. Algorithmica 28(3): 269-270 (2000)
- [j12]Bala Kalyanasundaram, Kirk Pruhs: Speed is as powerful as clairvoyance. J. ACM 47(4): 617-643 (2000)
- [j11]Bala Kalyanasundaram, Kirk Pruhs: The Online Transportation Problem. SIAM J. Discrete Math. 13(3): 370-383 (2000)
- [j10]Bala Kalyanasundaram, Kirk Pruhs: An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci. 233(1-2): 319-325 (2000)
- [c17]Bala Kalyanasundaram, Kirk Pruhs, Mahendran Velauthapillai: Scheduling Broadcasts in Wireless Networks. ESA 2000: 290-301
- [c16]Bala Kalyanasundaram, Kirk Pruhs: Dynamic Spectrum Allocation: The Impotency of Duration Notification. FSTTCS 2000: 421-428
- [c15]Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger: Caching for Web Searching. SWAT 2000: 150-163
1990 – 1999
- 1999
- [c14]Bala Kalyanasundaram, Kirk Pruhs: Eliminating Migration in Multi-Processor Scheduling. SODA 1999: 499-506
- 1998
- [j9]Kirk Pruhs: How to design dynamic programming algorithms sans recursion. SIGACT News 29(1): 32-35 (1998)
- [c13]
- 1997
- [j8]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)
- [c12]
- [c11]
- 1996
- [c10]Bala Kalyanasundaram, Kirk Pruhs: On-line Network Optimization Problems. Online Algorithms 1996: 268-280
- [c9]Bala Kalyanasundaram, Kirk Pruhs: An Optimal Deterministic Algorithm for Online b-Matching. FSTTCS 1996: 193-199
- 1995
- [j7]Kirk Pruhs: Using Local Adaptations to Reconfigure a Spanning Tree of a Network. Discrete Applied Mathematics 57(1): 67-74 (1995)
- [c8]
- [c7]
- 1994
- [j6]Kirk Pruhs: Average-Case Scalable On-Line Algorithms for Fault Replacement. Inf. Process. Lett. 52(3): 131-136 (1994)
- [j5]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)
- [j4]Bala Kalyanasundaram, Kirk Pruhs: Constructing Competitive Tours from Local Information. Theor. Comput. Sci. 130(1): 125-138 (1994)
- [c6]
- 1993
- [j3]Bala Kalyanasundaram, Kirk Pruhs: A Competitive Analysis of Algorithms for Searching Unknown Scenes. Comput. Geom. 3: 139-155 (1993)
- [j2]
- [c5]Bala Kalyanasundaram, Kirk Pruhs: Constructing Competitive Tours From Local Information. ICALP 1993: 102-113
- [c4]Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts: Online Load Balancing of Temporary Tasks. WADS 1993: 119-130
- 1992
- [c3]Bala Kalyanasundaram, Kirk Pruhs: A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version). STACS 1992: 147-157
- 1991
- [j1]
- [c2]
1980 – 1989
- 1989
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:56 CEST by the dblp team