32 citations · 57 across the 7 of their papers we have counts for
Showing 2017 · math.PRShow all
3 papers · 2 filters
math.PR2017
A limit field for orthogonal range searches in two-dimensional random point search trees
Nicolas Broutin, Henning Sulzbach
We consider the cost of general orthogonal range queries in random quadtrees. The cost of a given query is encoded into a (random) function of four variables which characterize the…
math.PR2017
On weighted depths in random binary search trees
Rafik Aguech, Anis Amri, Henning Sulzbach
Following the model introduced by Aguech, Lasmar and Mahmoud [Probab. Engrg. Inform. Sci. 21 (2007) 133-141], the weighted depth of a node in a labelled rooted tree is the sum of a…
math.PR2017★ 1 cited
The heavy path approach to Galton-Watson trees with an application to Apollonian networks
Luc Devroye, Cecilia Holmgren, Henning Sulzbach
We study the heavy path decomposition of conditional Galton-Watson trees. In a standard Galton-Watson tree conditional on its size , we order all children by their subtree sizes…