| 2008 |
| 32 | EE | Prahladh Harsha,
Thomas P. Hayes,
Hariharan Narayanan,
Harald Räcke,
Jaikumar Radhakrishnan:
Minimizing average latency in oblivious routing.
SODA 2008: 200-207 |
| 31 | EE | Harald Räcke:
Optimal hierarchical decompositions for congestion minimization in networks.
STOC 2008: 255-264 |
| 30 | EE | Shuchi Chawla,
Anupam Gupta,
Harald Räcke:
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut.
ACM Transactions on Algorithms 4(2): (2008) |
| 2007 |
| 29 | EE | Matthias Englert,
Harald Räcke,
Matthias Westermann:
Reordering buffers for general metric spaces.
STOC 2007: 556-564 |
| 28 | EE | Mohammad Taghi Hajiaghayi,
Robert D. Kleinberg,
Harald Räcke,
Tom Leighton:
Oblivious routing on node-capacitated and directed graphs.
ACM Transactions on Algorithms 3(4): (2007) |
| 2006 |
| 27 | EE | Kedar Dhamdhere,
Anupam Gupta,
Harald Räcke:
Improved embeddings of graph metrics into random trees.
SODA 2006: 61-69 |
| 26 | EE | Mohammad Taghi Hajiaghayi,
Robert D. Kleinberg,
Frank Thomson Leighton,
Harald Räcke:
New lower bounds for oblivious routing in undirected graphs.
SODA 2006: 918-927 |
| 25 | EE | Anupam Gupta,
Mohammad Taghi Hajiaghayi,
Harald Räcke:
Oblivious network design.
SODA 2006: 970-979 |
| 24 | EE | Simon Fischer,
Harald Räcke,
Berthold Vöcking:
Fast convergence to Wardrop equilibria by adaptive sampling methods.
STOC 2006: 653-662 |
| 23 | EE | Mohammad Taghi Hajiaghayi,
Harald Räcke:
An O(sqrt(n))-approximation algorithm for directed sparsest cut.
Inf. Process. Lett. 97(4): 156-160 (2006) |
| 22 | EE | Konstantin Andreev,
Harald Räcke:
Balanced Graph Partitioning.
Theory Comput. Syst. 39(6): 929-939 (2006) |
| 2005 |
| 21 | EE | Shuchi Chawla,
Anupam Gupta,
Harald Räcke:
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut.
SODA 2005: 102-111 |
| 20 | EE | Mihai Badoiu,
Kedar Dhamdhere,
Anupam Gupta,
Yuri Rabinovich,
Harald Räcke,
R. Ravi,
Anastasios Sidiropoulos:
Approximation algorithms for low-distortion embeddings into low-dimensional spaces.
SODA 2005: 119-128 |
| 19 | EE | Mohammad Taghi Hajiaghayi,
Robert D. Kleinberg,
Tom Leighton,
Harald Räcke:
Oblivious routing on node-capacitated and directed graphs.
SODA 2005: 782-790 |
| 18 | EE | Harald Räcke,
Adi Rosén:
Distributed online call control on general networks.
SODA 2005: 791-800 |
| 17 | EE | Mohammad Taghi Hajiaghayi,
Jeong Han Kim,
Tom Leighton,
Harald Räcke:
Oblivious routing in directed graphs with random demands.
STOC 2005: 193-201 |
| 16 | EE | Harald Räcke:
Datenverwaltung und Routing in allgemeinen Netzwerken.
it - Information Technology 47(4): 232-234 (2005) |
| 2004 |
| 15 | EE | Konstantin Andreev,
Harald Räcke:
Balanced graph partitioning.
SPAA 2004: 120-124 |
| 14 | | Jens Krokowski,
Harald Räcke,
Christian Sohler,
Matthias Westermann:
Reducing State Changes with a Pipeline Buffer.
VMV 2004: 217 |
| 13 | EE | Yossi Azar,
Edith Cohen,
Amos Fiat,
Haim Kaplan,
Harald Räcke:
Optimal oblivious routing in polynomial time.
J. Comput. Syst. Sci. 69(3): 383-394 (2004) |
| 2003 |
| 12 | EE | Valentina Damerow,
Friedhelm Meyer auf der Heide,
Harald Räcke,
Christian Scheideler,
Christian Sohler:
Smoothed Motion Complexity.
ESA 2003: 161-171 |
| 11 | EE | Marcin Bienkowski,
Miroslaw Korzeniowski,
Harald Räcke:
A practical algorithm for constructing oblivious routing schemes.
SPAA 2003: 24-33 |
| 10 | EE | Yossi Azar,
Edith Cohen,
Amos Fiat,
Haim Kaplan,
Harald Räcke:
Optimal oblivious routing in polynomial time.
STOC 2003: 383-388 |
| 9 | | Micah Adler,
Harald Räcke,
Naveen Sivadasan,
Christian Sohler,
Berthold Vöcking:
Randomized Pursuit-Evasion In Graphs.
Combinatorics, Probability & Computing 12(3): (2003) |
| 8 | EE | Christof Krick,
Harald Räcke,
Matthias Westermann:
Approximation Algorithms for Data Management in Networks.
Theory Comput. Syst. 36(5): 497-519 (2003) |
| 2002 |
| 7 | EE | Harald Räcke,
Christian Sohler,
Matthias Westermann:
Online Scheduling for Sorting Buffers.
ESA 2002: 820-832 |
| 6 | EE | Harald Räcke:
Minimizing Congestion in General Networks.
FOCS 2002: 43-52 |
| 5 | EE | Micah Adler,
Harald Räcke,
Naveen Sivadasan,
Christian Sohler,
Berthold Vöcking:
Randomized Pursuit-Evasion in Graphs.
ICALP 2002: 901-912 |
| 4 | EE | Christof Krick,
Friedhelm Meyer auf der Heide,
Harald Räcke,
Berthold Vöcking,
Matthias Westermann:
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.
Theory Comput. Syst. 35(2): 217-245 (2002) |
| 2001 |
| 3 | EE | Christof Krick,
Harald Räcke,
Matthias Westermann:
Approximation algorithms for data management in networks.
SPAA 2001: 237-246 |
| 2000 |
| 2 | EE | Friedhelm Meyer auf der Heide,
Harald Räcke,
Matthias Westermann:
Data management in hierarchical bus networks.
SPAA 2000: 109-118 |
| 1999 |
| 1 | EE | Christof Krick,
Friedhelm Meyer auf der Heide,
Harald Räcke,
Berthold Vöcking,
Matthias Westermann:
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.
SPAA 1999: 165-174 |