Harald Räcke

From MaRDI portal
Person:693766

Available identifiers

zbMath Open racke.haraldMaRDI QIDQ693766

List of research outcomes





PublicationDate of PublicationType
Dynamic maintenance of monotone dynamic programs and applications2024-10-08Paper
https://portal.mardi4nfdi.de/entity/Q61473882024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q61474242024-01-15Paper
Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality2023-12-08Paper
https://portal.mardi4nfdi.de/entity/Q58745052023-02-07Paper
Almost Tight Bounds for Reordering Buffer Management2022-06-08Paper
https://portal.mardi4nfdi.de/entity/Q50758232022-05-11Paper
https://portal.mardi4nfdi.de/entity/Q51113642020-05-27Paper
Computing Cut-Based Hierarchical Decompositions in Almost Linear Time2019-06-20Paper
https://portal.mardi4nfdi.de/entity/Q57435092019-05-10Paper
An O (log k )-Competitive Algorithm for Generalized Caching2019-03-28Paper
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces2019-03-12Paper
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut2018-11-05Paper
Oblivious routing on node-capacitated and directed graphs2018-11-05Paper
Reordering Buffers with Logarithmic Diameter Dependency for Trees2018-07-16Paper
https://portal.mardi4nfdi.de/entity/Q46019102018-01-24Paper
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering2017-12-19Paper
Vertex Sparsification in Trees2017-04-04Paper
Fast convergence to Wardrop equilibria by adaptive sampling methods2014-11-25Paper
Vertex sparsifiers: new results from old techniques2014-11-14Paper
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut2014-10-13Paper
Approximation algorithms for low-distortion embeddings into low-dimensional spaces2014-10-13Paper
Oblivious routing on node-capacitated and directed graphs2014-10-13Paper
Distributed online call control on general networks2014-10-13Paper
Improved Guarantees for Tree Cut Sparsifiers2014-10-08Paper
Smoothed analysis of left-to-right maxima with applications2014-09-09Paper
Oblivious Routing for the Lp-norm2014-07-25Paper
Oblivious interference scheduling2014-07-23Paper
Online Stochastic Reordering Buffer Scheduling2014-07-01Paper
Almost tight bounds for reordering buffer management2014-06-05Paper
Optimal online buffer scheduling for block devices2014-05-13Paper
Approximation algorithms for time-constrained scheduling on line networks2012-12-10Paper
https://portal.mardi4nfdi.de/entity/Q30028152011-05-24Paper
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods2011-04-04Paper
Vertex Sparsifiers: New Results from Old Techniques2010-09-10Paper
Oblivious network design2010-08-16Paper
Optimal oblivious routing in polynomial time2010-08-16Paper
New lower bounds for oblivious routing in undirected graphs2010-08-16Paper
Improved embeddings of graph metrics into random trees2010-08-16Paper
Oblivious routing in directed graphs with random demands2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35794442010-08-06Paper
Survey on Oblivious Routing Strategies2010-07-28Paper
Algorithms - ESA 20032010-03-03Paper
An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut2009-12-18Paper
https://portal.mardi4nfdi.de/entity/Q35497092009-01-05Paper
https://portal.mardi4nfdi.de/entity/Q35496552009-01-05Paper
Balanced graph partitioning2007-01-25Paper
Optimal oblivious routing in polynomial time2004-11-18Paper
Approximation algorithms for data management in networks2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q47372182004-08-11Paper
Randomized Pursuit-Evasion in Graphs2004-06-18Paper
https://portal.mardi4nfdi.de/entity/Q44114132003-07-08Paper
Data management in networks: Experimental evaluation of a provably good strategy2002-06-27Paper

Research outcomes over time

This page was built for person: Harald Räcke