On the expected height of fringe-blanced trees
type: Item
instance of: scholarly article
title: On the expected height of fringe-blanced trees
zbMATH Open document ID: 0790.68025
DOI: 10.1007/BF01210596
published in: Acta Informatica
publication date: 1994-07-04T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 567315
zbMATH Keywords: random binary search tree
author: Luc Devroye
MaRDI profile type: Publication
cites work: Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
cites work: The first- and last-birth problems for a multitype age-dependent branching process
cites work: Chernoff's theorem in the branching random walk
cites work: A note on the height of binary search trees
cites work: Branching processes in the analysis of the heights of trees
cites work: On the height of random m‐ary search trees
cites work: Q4016521
cites work: Postulates for subadditive processes
cites work: Subadditive ergodic theory
cites work: Q4004056
cites work: On growing random binary trees
cites work: The analysis of a fringe heuristic for binary search trees
cites work: Q5521185
cites work: Locally balanced binary trees
description: scientific article; zbMATH DE number 567315