Travelled to:1 × Canada
1 × Denmark
1 × Spain
6 × USA
Collaborated with:M.Englert B.Vöcking A.Adamaszek A.Czumaj ∅ M.Westermann S.Fischer M.T.Hajiaghayi J.H.Kim T.Leighton Y.Azar E.Cohen A.Fiat H.Kaplan M.Adler N.Sivadasan C.Sohler H.Esfandiari M.Hajiaghayi M.R.Khani V.Liaghat H.Mahini
Talks about:buffer (4) reorder (3) optim (3) schedul (2) random (2) oblivi (2) onlin (2) graph (2) rout (2) equilibria (1)
Person: Harald Räcke
DBLP: R=auml=cke:Harald
Contributed to:
2014
20122011200820072006200520032002Wrote 9 papers:
- ICALP-v1-2014-EsfandiariHKLMR #online #order #probability #scheduling
- Online Stochastic Reordering Buffer Scheduling (HE, MH, MRK, VL, HM, HR), pp. 465–476.
- STOC-2012-AdamaszekCER #online #scheduling
- Optimal online buffer scheduling for block devices (AA, AC, ME, HR), pp. 589–598.
- STOC-2011-AdamaszekCER #bound #order
- Almost tight bounds for reordering buffer management (AA, AC, ME, HR), pp. 607–616.
- STOC-2008-Racke #network
- Optimal hierarchical decompositions for congestion minimization in networks (HR), pp. 255–264.
- STOC-2007-EnglertRW #metric #order
- Reordering buffers for general metric spaces (ME, HR, MW), pp. 556–564.
- STOC-2006-FischerRV #adaptation #convergence #performance
- Fast convergence to Wardrop equilibria by adaptive sampling methods (SF, HR, BV), pp. 653–662.
- STOC-2005-HajiaghayiKLR #graph #random
- Oblivious routing in directed graphs with random demands (MTH, JHK, TL, HR), pp. 193–201.
- STOC-2003-AzarCFKR #polynomial
- Optimal oblivious routing in polynomial time (YA, EC, AF, HK, HR), pp. 383–388.
- ICALP-2002-AdlerRSSV #graph #random
- Randomized Pursuit-Evasion in Graphs (MA, HR, NS, CS, BV), pp. 901–912.