Generate a tailored SOP for Dr. Christian Schulz. Improve your application with a focused, well-structured draft.
Christian Schulz received his Ph.D. in computer science from Karlsruhe Institute of Technology, Germany, in 2013. He led the graph partitioning and parallel processing subgroup under Peter Sanders and subsequently headed the algorithm engineering subgroup under Monika Henzinger in Vienna. In 2019, Schulz returned to Germany and became a full professor at Heidelberg University. He has published over 100 works, focusing primarily on scalable graph algorithms, including multilevel algorithms for hypergraph partitioning and clustering, parallel algorithms, dynamic graph problems, and machine learning applications. His contributions have garnered recognition, including the Heinz Billing Prize and various paper awards in conferences like IPDPS and IEEE CLUSTER. He has also credited several open-source projects and won competitions in the field of graph algorithms.
Heidelberg University • Heidelberg, Germany
Full professor in the Department of Computer Science, focusing on algorithm engineering and graph algorithms.
Administered by the Faculty of Mathematics and Computer Science; covers Department of Mathematics and Department of Applied Mathematics.