Prof. Dr. Harald Räcke
Academic Career and Research Areas
Prof. Räcke (b. 1973) is interested in the design and theoretical analysis of algorithms. In particular he develops approximation and online algorithms for problems in the area of graph partitioning, scheduling and routing in parallel systems, and in metric embeddings.
After studying Computer Science at the University of Paderborn, Prof. Räcke received his doctorate in 2003 under the supervision of Prof. Meyer auf der Heide. After two postdoctoral stints at the Carnegie Mellon University in Pittsburgh, and the Toyota Technological Institute at Chicago he became an Assistant Professor at the University of Warwick in 2007. He became an Associate Professor in the Algorithms and Complexity group at TUM in 2011.
- Best Paper Award, 40th ACM Symposium on Theory of Computing (2008)
- Best Paper Award, 43rd IEEE Symposium on Foundations of Computer Science (2002)
Räcke H, Shah C, Täubig H: "Computing cut-based hierarchical decompositions in almost linear time". Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA). 2014; 227-238.Abstract
Adamaszek A, Czumaj A, Englert M, Räcke H: "Optimal online buffer scheduling for block devices". Proceedings of the 44th ACM Symposium on Theory of Computing (STOC). 2012; 589-598.Abstract
Adamaszek A, Czumaj A, Englert M, Räcke H: "Almost tight bounds for reordering buffer management". Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC). 2011; 607-616.Abstract
Räcke H: "Optimal hierarchical decompositions for congestion minimization in networks". Proceedings of the 40th ACM Symposium on Theory of Computing (STOC). 2008; 255-264.Abstract
Räcke H: "Minimizing congestion in general networks". Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS). 2002: 43-52.Abstract