Henning Sulzbach

According to our database, Henning Sulzbach authored at least 13 papers between 2012 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Refined Asymptotics for the Number of Leaves of Random Point Quadtrees.

Michael Fuchs, Noela S. Müller, Henning Sulzbach

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

On martingale tail sums for the path length in random trees.

Henning Sulzbach

Random Struct. Algorithms, 2017

On martingale tail sums in affine two-color urn models with multiple drawings.

Markus Kuba, Henning Sulzbach

J. Appl. Probab., 2017

A limit field for orthogonal range searches in two-dimensional random point search trees.

Nicolas Broutin, Henning Sulzbach

CoRR, 2017

The heavy path approach to Galton-Watson trees with an application to Apollonian networks.

Luc Devroye, Cecilia Holmgren, Henning Sulzbach

CoRR, 2017

On weighted depths in random binary search trees.

Rafik Aguech, Anis Amri, Henning Sulzbach

CoRR, 2017

2016

Mode and Edgeworth Expansion for the Ewens Distribution and the Stirling Numbers.

Zakhar Kabluchko, Alexander Marynych, Henning Sulzbach

J. Integer Seq., 2016

Process convergence for the complexity of Radix Selection on Markov sources.

Kevin Leckey, Ralph Neininger, Henning Sulzbach

CoRR, 2016

2014

The law of the iterated logarithm for the path length in random binary search trees.

Henning Sulzbach

CoRR, 2014

2012

The dual tree of a recursive triangulation of the disk

Nicolas Broutin, Henning Sulzbach

CoRR, 2012

On a functional contraction method

Ralph Neininger, Henning Sulzbach

CoRR, 2012

A limit process for partial match queries in random quadtrees

Nicolas Broutin, Ralph Neininger, Henning Sulzbach

CoRR, 2012

Partial match queries in random quadtrees.

Nicolas Broutin, Ralph Neininger, Henning Sulzbach

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012