Henning Sulzbach received his diploma in Mathematics working on the profile of random binary search trees at the Goethe University of Frankfurt in 2007. In 2012, he obtained his PhD under the supervision of Prof Ralph Neininger at the same university. His thesis deals with the foundation of a functional contraction method for distributional recurrences with applications to invariance principles for random sums and standard data base operations in multidimensional data structures.
Holding a research fellowship from the Fondation Sciences Mathématiques de Paris, Henning spent one year at the research institute INRIA (Institut national de recherche en informatique et en automatique) in Paris. There, he was working with Nicolas Broutin on the geometry of scaling limits for random trees.
From 2014 to 2016, Henning joined the McGill University in Montreal on a Feodor Lynen Research Fellowship of the Alexander von Humboldt Foundation. Together with Luc Devroye, he was working on structural results for Galton-Watson trees, an important graph model with numerous applications.