Harald Räcke

Valentina Damerow, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, Till Tantau: Smoothed analysis of left-to-right maxima with applications. ACM Transactions on Algorithms 8(3): 30 (2012)

Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke: An O(log k)-competitive algorithm for generalized caching. SODA 2012: 1681-1689

Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke: Optimal online buffer scheduling for block devices. STOC 2012: 589-598

Harald Räcke, Adi Rosén: Approximation Algorithms for Time-Constrained Scheduling on Line Networks. Theory Comput. Syst. 49(4): 834-856 (2011)

Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke: Almost tight bounds for reordering buffer management. STOC 2011: 607-616

Simon Fischer, Harald Räcke, Berthold Vöcking: Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods. SIAM J. Comput. 39(8): 3700-3735 (2010)

Matthias Englert, Harald Räcke, Matthias Westermann: Reordering Buffers for General Metric Spaces. Theory of Computing 6(1): 27-46 (2010)

Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar: Vertex Sparsifiers: New Results from Old Techniques. APPROX-RANDOM 2010: 152-165

Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar: Vertex Sparsifiers: New Results from Old Techniques. CoRR abs/1006.4586 (2010)

Harald Räcke: Survey on Oblivious Routing Strategies. CiE 2009: 419-429

Matthias Englert, Harald Räcke: Oblivious Routing for the Lp-norm. FOCS 2009: 32-40

Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking: Oblivious interference scheduling. PODC 2009: 220-229

Harald Räcke, Adi Rosén: Approximation algorithms for time-constrained scheduling on line networks. SPAA 2009: 337-346

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)

Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan: Minimizing average latency in oblivious routing. SODA 2008: 200-207

Harald Räcke: Optimal hierarchical decompositions for congestion minimization in networks. STOC 2008: 255-264

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)

Matthias Englert, Harald Räcke, Matthias Westermann: Reordering buffers for general metric spaces. STOC 2007: 556-564

Mohammad Taghi Hajiaghayi, Harald Räcke: An O(sqrt(n))-approximation algorithm for directed sparsest cut. Inf. Process. Lett. 97(4): 156-160 (2006)

Konstantin Andreev, Harald Räcke: Balanced Graph Partitioning. Theory Comput. Syst. 39(6): 929-939 (2006)

Kedar Dhamdhere, Anupam Gupta, Harald Räcke: Improved embeddings of graph metrics into random trees. SODA 2006: 61-69

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

Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke: Oblivious network design. SODA 2006: 970-979

Simon Fischer, Harald Räcke, Berthold Vöcking: Fast convergence to Wardrop equilibria by adaptive sampling methods. STOC 2006: 653-662

Harald Räcke: Datenverwaltung und Routing in allgemeinen Netzwerken. it - Information Technology 47(4): 232-234 (2005)

Shuchi Chawla, Anupam Gupta, Harald Räcke: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. SODA 2005: 102-111

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

Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke: Oblivious routing on node-capacitated and directed graphs. SODA 2005: 782-790

Harald Räcke, Adi Rosén: Distributed online call control on general networks. SODA 2005: 791-800

Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke: Oblivious routing in directed graphs with random demands. STOC 2005: 193-201

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)

Konstantin Andreev, Harald Räcke: Balanced graph partitioning. SPAA 2004: 120-124

Jens Krokowski, Harald Räcke, Christian Sohler, Matthias Westermann: Reducing State Changes with a Pipeline Buffer. VMV 2004: 217

Harald Räcke: Data management and routing in general networks. University of Paderborn 2003, isbn 3-935433-63-8, pp. 1-100

Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking: Randomized Pursuit-Evasion In Graphs. Combinatorics, Probability & Computing 12(3): 225-244 (2003)

Christof Krick, Harald Räcke, Matthias Westermann: Approximation Algorithms for Data Management in Networks. Theory Comput. Syst. 36(5): 497-519 (2003)

Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler: Smoothed Motion Complexity. ESA 2003: 161-171

Marcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke: A practical algorithm for constructing oblivious routing schemes. SPAA 2003: 24-33

Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke: Optimal oblivious routing in polynomial time. STOC 2003: 383-388

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)

Harald Räcke, Christian Sohler, Matthias Westermann: Online Scheduling for Sorting Buffers. ESA 2002: 820-832

Harald Räcke: Minimizing Congestion in General Networks. FOCS 2002: 43-52

Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking: Randomized Pursuit-Evasion in Graphs. ICALP 2002: 901-912

Christof Krick, Harald Räcke, Matthias Westermann: Approximation algorithms for data management in networks. SPAA 2001: 237-246

Friedhelm Meyer auf der Heide, Harald Räcke, Matthias Westermann: Data management in hierarchical bus networks. SPAA 2000: 109-118

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