Travelled to:1 × Canada
1 × France
1 × Greece
1 × Italy
1 × Korea
1 × Poland
1 × Sweden
3 × USA
Collaborated with:N.Bansal B.Kalyanasundaram R.Krishnaswamy H.Chan P.K.Chrysanthis U.Manber A.Gupta M.Aly V.Nagarajan C.Stein D.Katz M.A.Sharaf A.Labrinidis
Talks about:schedul (5) network (3) heterogen (2) competit (2) effici (2) processor (1) construct (1) algorithm (1) hallucin (1) approxim (1)
Person: Kirk Pruhs
DBLP: Pruhs:Kirk
Contributed to:
2014
201020092007
2006
20062003199419931989Wrote 10 papers:
- STOC-2014-KrishnaswamyNPS #approximate #clustering #design #energy #network #performance
- Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing (RK, VN, KP, CS), pp. 734–743.
- ICALP-v1-2010-GuptaKP #scheduling
- Scalably Scheduling Power-Heterogeneous Processors (AG, RK, KP), pp. 312–323.
- ICALP-v1-2009-BansalCPK #bound #scalability
- Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule (NB, HLC, KP, DK), pp. 144–155.
- ICALP-2007-BansalCP #algorithm #scheduling
- Competitive Algorithms for Due Date Scheduling (NB, HLC, KP), pp. 28–39.
- CIKM-2006-AlyPC #named #network
- KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks (MA, KP, PKC), pp. 317–326.
- VLDB-2006-SharafCLP #performance #query #scheduling
- Efficient Scheduling of Heterogeneous Continuous Queries (MAS, PKC, AL, KP), pp. 511–522.
- STOC-2003-BansalP #scheduling
- Server scheduling in the Lp norm: a rising tide lifts all boat (NB, KP), pp. 242–250.
- STOC-1994-KalyanasundaramP #fault tolerance #scheduling
- Fault-tolerant scheduling (BK, KP), pp. 115–124.
- ICALP-1993-KalyanasundaramP #information management
- Constructing Competitive Tours From Local Information (BK, KP), pp. 102–113.
- ICALP-1989-PruhsM #complexity
- The Complexity of Controlled Selection (KP, UM), pp. 672–686.