Harald Räcke

According to our database, Harald Räcke authored at least 59 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Electrical Flows for Polylogarithmic Competitive Oblivious Routing.

Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

Dynamic Maintenance of Monotone Dynamic Programs and Applications.

Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands.

Harald Räcke, Stefan Schmid, Ruslan Zabrodin

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

2022

Almost Tight Bounds for Reordering Buffer Management.

Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke

SIAM J. Comput., 2022

Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality.

Bernhard Haeupler, Harald Räcke, Mohsen Ghaffari

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Approximate Dynamic Balanced Graph Partitioning.

Harald Räcke, Stefan Schmid, Ruslan Zabrodin

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

2021

Tight Bounds for Online Graph Partitioning.

Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms.

Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints.

Robin Münk, Matthias Rost, Harald Räcke, Stefan Schmid

Proceedings of the IFIP Networking Conference, 2021

Online Balanced Repartitioning of Dynamic Communication Patterns in Polynomial Time.

Tobias Forner, Harald Räcke, Stefan Schmid

Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

2020

Compact Oblivious Routing in Weighted Graphs.

Philipp Czerner, Harald Räcke

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

An <i>O</i>(log <i>k</i>)-Competitive Algorithm for Generalized Caching.

Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke

ACM Trans. Algorithms, 2019

Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces.

Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi

SIAM J. Discret. Math., 2019

Polylogarithmic Guarantees for Generalized Reordering Buffer Management.

Matthias Englert, Harald Räcke, Richard Stotz

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Compact Oblivious Routing.

Harald Räcke, Stefan Schmid

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection.

Harald Räcke, Roy Schwartz, Richard Stotz

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

2017

Online Degree-Bounded Steiner Network Design.

Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke

CoRR, 2017

Reordering Buffers with Logarithmic Diameter Dependency for Trees.

Matthias Englert, Harald Räcke

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces.

Matthias Kohler, Harald Räcke

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Vertex Sparsification in Trees.

Gramoz Goranci, Harald Räcke

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Improved Approximation Algorithms for Balanced Partitioning Problems.

Harald Räcke, Richard Stotz

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering.

Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014

Vertex Sparsifiers: New Results from Old Techniques.

Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar

SIAM J. Comput., 2014

Computing Cut-Based Hierarchical Decompositions in Almost Linear Time.

Harald Räcke, Chintan Shah, Hanjo Täubig

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Online Stochastic Reordering Buffer Scheduling.

Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, Harald Räcke

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Improved Guarantees for Tree Cut Sparsifiers.

Harald Räcke, Chintan Shah

Proceedings of the Algorithms - ESA 2014, 2014

2012

Smoothed analysis of left-to-right maxima with applications.

Valentina Damerow, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, Till Tantau

ACM Trans. Algorithms, 2012

Optimal online buffer scheduling for block devices.

Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

Approximation Algorithms for Time-Constrained Scheduling on Line Networks.

Harald Räcke, Adi Rosén

Theory Comput. Syst., 2011

2010

Reordering Buffers for General Metric Spaces.

Matthias Englert, Harald Räcke, Matthias Westermann

Theory Comput., 2010

Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods.

Simon Fischer, Harald Räcke, Berthold Vöcking

SIAM J. Comput., 2010

2009

Oblivious interference scheduling.

Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Oblivious Routing for the Lp-norm.

Matthias Englert, Harald Räcke

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Survey on Oblivious Routing Strategies.

Harald Räcke

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut.

Shuchi Chawla, Anupam Gupta, Harald Räcke

ACM Trans. Algorithms, 2008

Optimal hierarchical decompositions for congestion minimization in networks.

Harald Räcke

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Minimizing average latency in oblivious routing.

Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Oblivious routing on node-capacitated and directed graphs.

Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton

ACM Trans. Algorithms, 2007

2006

Balanced Graph Partitioning.

Konstantin Andreev, Harald Räcke

Theory Comput. Syst., 2006

An O(sqrt(n))-approximation algorithm for directed sparsest cut.

Mohammad Taghi Hajiaghayi, Harald Räcke

Inf. Process. Lett., 2006

New lower bounds for oblivious routing in undirected graphs.

Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Oblivious network design.

Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Improved embeddings of graph metrics into random trees.

Kedar Dhamdhere, Anupam Gupta, Harald Räcke

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Datenverwaltung und Routing in allgemeinen Netzwerken.

Harald Räcke

it Inf. Technol., 2005

Oblivious routing in directed graphs with random demands.

Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Distributed online call control on general networks.

Harald Räcke, Adi Rosén

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Approximation algorithms for low-distortion embeddings into low-dimensional spaces.

Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Optimal oblivious routing in polynomial time.

Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke

J. Comput. Syst. Sci., 2004

Reducing State Changes with a Pipeline Buffer.

Jens Krokowski, Harald Räcke, Christian Sohler, Matthias Westermann

Proceedings of the 9th International Fall Workshop on Vision, Modeling, and Visualization, 2004

2003

Data management and routing in general networks.

Harald Räcke

PhD thesis, 2003

Approximation Algorithms for Data Management in Networks.

Christof Krick, Harald Räcke, Matthias Westermann

Theory Comput. Syst., 2003

Randomized Pursuit-Evasion In Graphs.

Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking

Comb. Probab. Comput., 2003

A practical algorithm for constructing oblivious routing schemes.

Marcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Data management and routing in general networks.

Harald Räcke

Proceedings of the Ausgezeichnete Informatikdissertationen 2003, 2003

Smoothed Motion Complexity.

Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler

Proceedings of the Algorithms, 2003

2002

Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.

Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann

Theory Comput. Syst., 2002

Minimizing Congestion in General Networks.

Harald Räcke

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Online Scheduling for Sorting Buffers.

Harald Räcke, Christian Sohler, Matthias Westermann

Proceedings of the Algorithms, 2002

2000

Data management in hierarchical bus networks.

Friedhelm Meyer auf der Heide, Harald Räcke, Matthias Westermann

Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000