default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarald Räcke
Person information
- affiliation: TU Munich, Faculty of Computer Science
- affiliation: University of Warwick, Department of Computer Science
- affiliation: Carnegie Mellon University, School of Computer Science
- affiliation: University of Paderborn, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c54]Harald Räcke, Stefan Schmid, Radu Vintan:
Fast Algorithms for Loop-Free Network Updates using Linear Programming and Local Search. INFOCOM 2024: 1930-1939- [c53]Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan:
Electrical Flows for Polylogarithmic Competitive Oblivious Routing. ITCS 2024: 55:1-55:22 - [c52]Kathrin Hanauer
, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch:
Expander Hierarchies for Normalized Cuts on Graphs. KDD 2024: 1016-1027 - [i13]Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch:
Expander Hierarchies for Normalized Cuts on Graphs. CoRR abs/2406.14111 (2024) - 2023
- [c51]Harald Räcke, Stefan Schmid, Ruslan Zabrodin:
Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands. SPAA 2023: 403-413 - [c50]Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid:
Dynamic Maintenance of Monotone Dynamic Programs and Applications. STACS 2023: 36:1-36:16 - [i12]Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid:
Dynamic Maintenance of Monotone Dynamic Programs and Applications. CoRR abs/2301.01744 (2023) - [i11]Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan:
Electrical Flows for Polylogarithmic Competitive Oblivious Routing. CoRR abs/2303.02491 (2023) - [i10]Harald Räcke, Stefan Schmid, Ruslan Zabrodin:
Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands. CoRR abs/2304.10350 (2023) - 2022
- [j17]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
Almost Tight Bounds for Reordering Buffer Management. SIAM J. Comput. 51(3): 701-722 (2022) - [c49]Harald Räcke, Stefan Schmid, Ruslan Zabrodin:
Approximate Dynamic Balanced Graph Partitioning. SPAA 2022: 401-409 - [c48]Bernhard Haeupler, Harald Räcke, Mohsen Ghaffari:
Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. STOC 2022: 1325-1338 - 2021
- [c47]Tobias Forner, Harald Räcke, Stefan Schmid:
Online Balanced Repartitioning of Dynamic Communication Patterns in Polynomial Time. APOCS 2021: 40-54 - [c46]Robin Münk, Matthias Rost, Harald Räcke, Stefan Schmid:
It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints. Networking 2021: 1-3 - [c45]Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan:
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. SODA 2021: 2212-2228 - [c44]Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid:
Tight Bounds for Online Graph Partitioning. SODA 2021: 2799-2818 - [i9]Robin Münk, Matthias Rost, Stefan Schmid, Harald Räcke:
It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints. CoRR abs/2104.09249 (2021) - 2020
- [c43]Philipp Czerner, Harald Räcke:
Compact Oblivious Routing in Weighted Graphs. ESA 2020: 36:1-36:23 - [i8]Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan:
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. CoRR abs/2005.02369 (2020) - [i7]Philipp Czerner, Harald Räcke:
Compact Oblivious Routing in Weighted Graphs. CoRR abs/2007.02427 (2020) - [i6]Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid:
Tight Bounds for Online Graph Partitioning. CoRR abs/2011.01017 (2020)
2010 – 2019
- 2019
- [j16]Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi:
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces. SIAM J. Discret. Math. 33(1): 454-473 (2019) - [j15]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
An O(log k)-Competitive Algorithm for Generalized Caching. ACM Trans. Algorithms 15(1): 6:1-6:18 (2019) - [c42]Harald Räcke, Stefan Schmid:
Compact Oblivious Routing. ESA 2019: 75:1-75:14 - [c41]Matthias Englert, Harald Räcke, Richard Stotz:
Polylogarithmic Guarantees for Generalized Reordering Buffer Management. FOCS 2019: 38-59 - 2018
- [c40]Harald Räcke, Roy Schwartz, Richard Stotz:
Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection. SPAA 2018: 23-32 - [i5]Harald Räcke, Stefan Schmid:
Compact Oblivious Routing. CoRR abs/1812.09887 (2018) - 2017
- [c39]Matthias Kohler, Harald Räcke:
Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces. ICALP 2017: 33:1-33:12 - [c38]Matthias Englert, Harald Räcke:
Reordering Buffers with Logarithmic Diameter Dependency for Trees. SODA 2017: 1224-1234 - [i4]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke:
Online Degree-Bounded Steiner Network Design. CoRR abs/1704.05430 (2017) - [i3]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin:
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. CoRR abs/1704.05811 (2017) - 2016
- [c37]Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin:
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. ICALP 2016: 42:1-42:14 - [c36]Harald Räcke, Richard Stotz:
Improved Approximation Algorithms for Balanced Partitioning Problems. STACS 2016: 58:1-58:14 - [c35]Gramoz Goranci, Harald Räcke:
Vertex Sparsification in Trees. WAOA 2016: 103-115 - [i2]Gramoz Goranci, Harald Räcke:
Vertex Sparsification in Trees. CoRR abs/1612.03017 (2016) - 2014
- [j14]Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar:
Vertex Sparsifiers: New Results from Old Techniques. SIAM J. Comput. 43(4): 1239-1262 (2014) - [c34]Harald Räcke, Chintan Shah:
Improved Guarantees for Tree Cut Sparsifiers. ESA 2014: 774-785 - [c33]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, Harald Räcke:
Online Stochastic Reordering Buffer Scheduling. ICALP (1) 2014: 465-476 - [c32]Harald Räcke, Chintan Shah, Hanjo Täubig:
Computing Cut-Based Hierarchical Decompositions in Almost Linear Time. SODA 2014: 227-238 - 2012
- [j13]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 Trans. Algorithms 8(3): 30:1-30:28 (2012) - [c31]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
An O(log k)-competitive algorithm for generalized caching. SODA 2012: 1681-1689 - [c30]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
Optimal online buffer scheduling for block devices. STOC 2012: 589-598 - 2011
- [j12]Harald Räcke, Adi Rosén:
Approximation Algorithms for Time-Constrained Scheduling on Line Networks. Theory Comput. Syst. 49(4): 834-856 (2011) - [c29]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
Almost tight bounds for reordering buffer management. STOC 2011: 607-616 - 2010
- [j11]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) - [j10]Matthias Englert, Harald Räcke, Matthias Westermann:
Reordering Buffers for General Metric Spaces. Theory Comput. 6(1): 27-46 (2010) - [c28]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 - [i1]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)
2000 – 2009
- 2009
- [c27]Harald Räcke:
Survey on Oblivious Routing Strategies. CiE 2009: 419-429 - [c26]Matthias Englert, Harald Räcke:
Oblivious Routing for the Lp-norm. FOCS 2009: 32-40 - [c25]Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking:
Oblivious interference scheduling. PODC 2009: 220-229 - [c24]Harald Räcke, Adi Rosén:
Approximation algorithms for time-constrained scheduling on line networks. SPAA 2009: 337-346 - 2008
- [j9]Shuchi Chawla, Anupam Gupta, Harald Räcke:
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. ACM Trans. Algorithms 4(2): 22:1-22:18 (2008) - [c23]Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan:
Minimizing average latency in oblivious routing. SODA 2008: 200-207 - [c22]Harald Räcke:
Optimal hierarchical decompositions for congestion minimization in networks. STOC 2008: 255-264 - 2007
- [j8]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton:
Oblivious routing on node-capacitated and directed graphs. ACM Trans. Algorithms 3(4): 51 (2007) - [c21]Matthias Englert, Harald Räcke, Matthias Westermann:
Reordering buffers for general metric spaces. STOC 2007: 556-564 - 2006
- [j7]Mohammad Taghi Hajiaghayi, Harald Räcke:
An O(sqrt(n))-approximation algorithm for directed sparsest cut. Inf. Process. Lett. 97(4): 156-160 (2006) - [j6]Konstantin Andreev, Harald Räcke:
Balanced Graph Partitioning. Theory Comput. Syst. 39(6): 929-939 (2006) - [c20]Kedar Dhamdhere, Anupam Gupta, Harald Räcke:
Improved embeddings of graph metrics into random trees. SODA 2006: 61-69 - [c19]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 - [c18]Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke:
Oblivious network design. SODA 2006: 970-979 - [c17]Simon Fischer, Harald Räcke, Berthold Vöcking:
Fast convergence to Wardrop equilibria by adaptive sampling methods. STOC 2006: 653-662 - 2005
- [j5]Harald Räcke:
Datenverwaltung und Routing in allgemeinen Netzwerken. it Inf. Technol. 47(4): 232-234 (2005) - [c16]Shuchi Chawla, Anupam Gupta, Harald Räcke:
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. SODA 2005: 102-111 - [c15]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 - [c14]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke:
Oblivious routing on node-capacitated and directed graphs. SODA 2005: 782-790 - [c13]Harald Räcke, Adi Rosén:
Distributed online call control on general networks. SODA 2005: 791-800 - [c12]Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke:
Oblivious routing in directed graphs with random demands. STOC 2005: 193-201 - 2004
- [j4]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) - [c11]Konstantin Andreev, Harald Räcke:
Balanced graph partitioning. SPAA 2004: 120-124 - [c10]Jens Krokowski, Harald Räcke, Christian Sohler, Matthias Westermann:
Reducing State Changes with a Pipeline Buffer. VMV 2004: 217 - 2003
- [b1]Harald Räcke:
Data management and routing in general networks. University of Paderborn, Germany, 2003, ISBN 3-935433-63-8, pp. 1-100 - [j3]Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking:
Randomized Pursuit-Evasion In Graphs. Comb. Probab. Comput. 12(3): 225-244 (2003) - [j2]Christof Krick, Harald Räcke, Matthias Westermann:
Approximation Algorithms for Data Management in Networks. Theory Comput. Syst. 36(5): 497-519 (2003) - [c9]Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler:
Smoothed Motion Complexity. ESA 2003: 161-171 - [c8]Marcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke:
A practical algorithm for constructing oblivious routing schemes. SPAA 2003: 24-33 - [c7]Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke:
Optimal oblivious routing in polynomial time. STOC 2003: 383-388 - [p1]Harald Räcke:
Data management and routing in general networks. Ausgezeichnete Informatikdissertationen 2003: 179-188 - 2002
- [j1]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) - [c6]Harald Räcke, Christian Sohler, Matthias Westermann:
Online Scheduling for Sorting Buffers. ESA 2002: 820-832 - [c5]Harald Räcke:
Minimizing Congestion in General Networks. FOCS 2002: 43-52 - [c4]Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking:
Randomized Pursuit-Evasion in Graphs. ICALP 2002: 901-912 - 2001
- [c3]Christof Krick, Harald Räcke, Matthias Westermann:
Approximation algorithms for data management in networks. SPAA 2001: 237-246 - 2000
- [c2]Friedhelm Meyer auf der Heide, Harald Räcke, Matthias Westermann:
Data management in hierarchical bus networks. SPAA 2000: 109-118
1990 – 1999
- 1999
- [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
