Stochastic analysis of tree–like data structures

DOI10.1098/RSPA.2003.1243MaRDI QIDQ3043434zbMATH OpenOpenAlexFDO

Authors Michael Drmota

Publication date 6 August 2004

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

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

zbMATH Keywords

binary search treebinary treegenerating functionsheightpath lengthprofile

Mathematics Subject Classification ID

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

Recommendations

• Random binary trees: from the average case analysis to the asymptotics of distributions
• scientific article; zbMATH DE number 53861
• scientific article; zbMATH DE number 1246231
• Random binary trees. Algorithms, asymptotics and statistics
• On the subtrees of random binary search trees

Cited in

(8)

• Search trees and Stirling numbers
• Linear functional equations with a catalytic variable and area limit laws for lattice paths and polygons
• A probabilistic analysis of some tree algorithms
• Area limit laws for symmetry classes of staircase polygons
• scientific article; zbMATH DE number 5560473 (Why is no real title available?)
• scientific article; zbMATH DE number 1246231 (Why is no real title available?)
• Functional equations for data structures
• On \(q\)-functional equations and excursion moments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3043434)