Harald Räcke

Prof. Dr. Harald Räcke is a Professor at the Technische Universität München (TUM), affiliated with the TUM School of Computation, Information and Technology in the Effiziente Algorithmen department. His research focuses on the design and analysis of algorithms, particularly approximation algorithms, online algorithms, graph partitioning, scheduling, routing in parallel systems, and metric embeddings. He holds a PhD from the University of Paderborn and has held academic positions at institutions including Carnegie Mellon University (USA), Toyota Technological Institute (USA), and the University of Warwick (UK) before joining TUM in 2011. His work has been recognized with prestigious awards, including the Best Paper Awards at STOC 2008 and FOCS 2002.

Key research trends in his publications emphasize theoretical computer science and algorithm design, with a focus on optimizing network-related problems such as congestion minimization, balanced partitioning, and oblivious routing. His recent work explores dynamic graph algorithms and sparsification techniques, reflecting advancements in handling large-scale network challenges.

• Education:
  • PhD in Algorithms and Complexity (2003), University of Paderborn
  • Studies in Computer Science at University of Paderborn
• Professional Milestones:
  • Postdoc: Carnegie Mellon University (Pittsburgh, USA) and Toyota Technological Institute (Chicago, USA)
  • Assistant Professor at University of Warwick (UK)
  • Joined TUM in 2011

His scientific awards highlight contributions to theoretical computer science:

• Best Paper Award, 40th ACM Symposium on Theory of Computing (2008)
• Best Paper Award, 43rd IEEE Symposium on Foundations of Computer Science (2002)