Stochastic analysis of tree–like data structures

DOI10.1098/rspa.2003.1243zbMath1091.68034OpenAlexW1967476104MaRDI QIDQ3043434

Michael Drmota

Publication date: 6 August 2004

Published in: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1098/rspa.2003.1243

zbMATH Keywords

profilegenerating functionsheightbinary treebinary search treepath length

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Data structures (68P05)

Related Items (3)

Linear functional equations with a catalytic variable and area limit laws for lattice paths and polygons ⋮ Area Limit Laws for Symmetry Classes of Staircase Polygons ⋮ On \(q\)-functional equations and excursion moments

This page was built for publication: Stochastic analysis of tree–like data structures