Henning Sulzbach
Mathematician
I am lecturer at the University of Birmingham in Modern Statistics mostly interested in probability theory and its applications to the analysis of random discrete structures covering:
 the analysis of algorithms,
 random trees and graphs,
 urn processes,
 continuum trees and fractal dimensions.
Bibliography
 2016: PostDoc at the University of Münster with Zakhar Kabluchko [Feodor Lynen Return Fellowship of the Alexander von Humboldt Foundation]
 20142016: PostDoc at McGill University, Montreal with Luc Devroye (two years) [Feodor Lynen Research Fellowship of the Alexander von Humboldt Foundation]
 20132014: PostDoc at INRIA ParisRocquencourt with Nicolas Broutin (one year) [PostDoc scholarship from the FSMP]
 2013: PostDoc at the Goethe University of Frankfurt with Ralph Neininger (three months).
 2012: PostDoc at the the McGill University of Montreal with Luc Devroye (six months).
 20072012:
Postgraduate student at the Goethe University
Frankfurt under the supervision of
Ralph Neininger. Phd obtained in May 2012 (thesis available for download below).  20022007:
Studies in mathematics and theoretical physics
at the Goethe University of Frankfurt.
Diploma obtained in February 2007 under the supervision of Ralph Neininger.
Future Conferences
 June 2018: 29th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA), Uppsala
 July 2018: 12th International Vilnius Conference on Probability Theory and Mathematical Statistics, Vilnius
Publications and Preprints
 Das Profil zufälliger Binärsuchbäume. (in German) Diploma thesis, 2006.
 A functional limit law for the profile of planeoriented recursive trees. (English summary) Fifth Colloquium on Mathematics and Computer Science, 339350, Discrete Math. Theor. Comput. Sci. Proc., AI, Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2008.
 On a Functional Contraction Method. Dissertation, 2012.

Partial match queries in random quadtrees, joint work with Nicolas Broutin and Ralph Neininger, Proceedings of the ACMSIAM Symposium on Discrete Algorithms (SODA), 10561065, 2012. [arxiv]
 A limit process for partial match queries in random quadtrees and 2dtrees, joint work with Nicolas Broutin and Ralph Neininger, The Annals of Applied Probability 23(6), 25602603, 2013. [arxiv]

A Gaussian
limit process for optimal FIND
algorithms, joint work with
Ralph
Neininger and Michael
Drmota,
Electronic Journal of Probability 19, 28 pp, 2014. [arxiv]  Analysis of radix selection on Markov sources, joint work with Kevin Leckey and Ralph Neininger, Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms.(Eds. M. BousquetMélou, M. Soria).DMTCSHAL Proceedings series, 253264, 2014. [arxiv]
 The dual tree of a recursive triangulation of the disk, joint work with Nicolas Broutin, The Annals of Probability, 43(2), 738781, 2015. [arxiv]
 On a functional contraction method, joint work with Ralph Neininger, The Annals of Probability, 43, 17771822, 2015. [arxiv]
 On martingale tail sums for the path length in random trees, Random Structures & Algorithms, 50, 493508, 2017. [arxiv]
 On martingale tail sums in affine twocolor urn models with multiple drawings, joint work with Markus Kuba, Journal of Applied Probability, 54, 96117, 2017. [arxiv]
 Process convergence for the complexity of Radix Selection on Markov sources, joint work with Kevin Leckey and Ralph Neininger, Stochastic Processes and their Applications, in press, 2018. [arxiv]
 General Edgeworth expansions with applications to profiles of random trees, joint work with Zakhar Kabluchko and Alexander Marynych, to appear in The Annals of Applied Probability , 27(6), 34783524, 2017. [arxiv]
 Mode and Edgeworth Expansion for the Ewens Distribution and the Stirling Numbers, joint work with Zakhar Kabluchko and Alexander Marynych, Journal of Integer Sequences, 19(8), 2016. [arxiv]
 Selfsimilar real trees defined as fixedpoints and their geometric properties, joint work with Nicolas Broutin, submitted for publication, 2016. [arxiv]

The heavy path approach to GaltonWatson trees with an application to Apollonian networks, joint work with
Luc Devroye and Cecilia Holmgren,
submitted for publication, 2017. [arxiv] 
On Weighted Depths in Random Binary Search Trees, joint work with
Rafik Aguech and Anis Amri,
Journal of Theoretical Probability, 23 pp,
2017,
DOI 10.1007/s1095901707731  A limit field for orthogonal range searches in twodimensional random point search trees, joint work with Nicolas Broutin, submitted for publication, 2017. [arxiv]
 Refined Asymptotics for the Number of Leaves of Random Point Quadtrees, joint work with Michael Fuchs and Noela Müller, Proceedings of the 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms.(Eds. J. A. Fill, M. W. Ward). Leibniz International Proceedings in Informatics Schloss Dagstuhl (LIPICS), 16 pp, 2018.
Selected Talks
 A new proof for Donsker's invariance principle, 9th German open conference on probability and statistics, Leipzig (Germany), 2010. [slides]
 Probabilistic analysis of a search tree problem, 12th Latin American Congress of Probability and Mathematical Statistics, Vina del Mar (Chile), 2012. [slides]
 Triangulations, dual trees and fractal dimensions, CMS Winter meeting, Montreal, 2015. [slides]
 GaltonWatson trees and Apollonian networks, 28th Conference on Analysis of Algorithms (AofA), Princeton, 2017. [slides]
 Asymptotic expansions for the profiles of random trees, ALEA in Europe, Vienna, 2017. [slides]
Contact information
Office hours 2018/2019: to be determined
Henning Sulzbach
School of Mathematics
University of Birmingham
Watson Building, Office 202
Birmingham B15 2TT
Great Britain
Email: first.last@gmail.com