The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kirk Pruhs: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  75. Speed Scaling with a Solar Cell. [Citation Graph (, )][DBLP]


  76. Confidently Cutting a Cake into Approximately Fair Pieces. [Citation Graph (, )][DBLP]


  77. How to Schedule When You Have to Buy Your Energy. [Citation Graph (, )][DBLP]


  78. 07261 Summary -- Fair Division. [Citation Graph (, )][DBLP]


  79. 07261 Abstracts Collection -- Fair Division. [Citation Graph (, )][DBLP]


  80. 08071 Abstracts Collection -- Scheduling. [Citation Graph (, )][DBLP]


  81. 08071 Executive Summary -- Scheduling. [Citation Graph (, )][DBLP]


  82. Non-Preemptive Min-Sum Scheduling with Resource Augmentation. [Citation Graph (, )][DBLP]


  83. Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. [Citation Graph (, )][DBLP]


  84. Scalably Scheduling Power-Heterogeneous Processors. [Citation Graph (, )][DBLP]


  85. Poster session: ASETS: A self-managing transaction scheduler. [Citation Graph (, )][DBLP]


  86. Adaptive Scheduling of Web Transactions. [Citation Graph (, )][DBLP]


  87. Admission control mechanisms for continuous queries in the cloud. [Citation Graph (, )][DBLP]


  88. Scalable data dissemination using hybrid methods. [Citation Graph (, )][DBLP]


  89. The Power of Fair Pricing Mechanisms. [Citation Graph (, )][DBLP]


  90. The Online Transportation Problem: On the Exponential Boost of One Extra Server. [Citation Graph (, )][DBLP]


  91. Average Rate Speed Scaling. [Citation Graph (, )][DBLP]


  92. Scalably scheduling processes with arbitrary speedup curves. [Citation Graph (, )][DBLP]


  93. Speed scaling with an arbitrary power function. [Citation Graph (, )][DBLP]


  94. Speed scaling of processes with arbitrary speedup curves on a multiprocessor. [Citation Graph (, )][DBLP]


  95. Scheduling jobs with varying parallelizability to reduce variance. [Citation Graph (, )][DBLP]


  96. Nonclairvoyant Speed Scaling for Flow and Energy. [Citation Graph (, )][DBLP]


  97. Zone sharing: a hot-spots decomposition scheme for data-centric storage in sensor networks. [Citation Graph (, )][DBLP]


  98. The Price of Stochastic Anarchy. [Citation Graph (, )][DBLP]


  99. Nonclairvoyant Speed Scaling for Flow and Energy [Citation Graph (, )][DBLP]


  100. The Geometry of Scheduling [Citation Graph (, )][DBLP]


Search in 0.036secs, Finished in 0.040secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002