The subtree size profile of bucket recursive trees

DOI10.7508/IJMSI.2016.01.001MaRDI QIDQ2834862zbMATH OpenOpenAlexFDO

Authors Ramin. Kazemi

Publication date 24 November 2016

Published in Iranian Journal of Mathematical Sciences and Informatics (Search for Journal in Brave)

Full work available at URL https://www.ijmsi.ir/article-1-381-en.pdf

zbMATH Keywords

factorial momentsbucket recursive treesubtree size profile

Mathematics Subject Classification ID

Trees (05C05) Central limit and other weak theorems (60F05)

Recommendations

• On the subtree size profile of binary search trees
• The subtree size profile of plane-oriented recursive trees
• Depth in bucket recursive trees with variable capacities of buckets
• A combinatorial approach to the analysis of bucket recursive trees
• Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
• Branches in bucket recursive trees with variable capacities of buckets
• Probabilistic analysis of bucket recursive trees
• The profile of binary search trees
• scientific article; zbMATH DE number 6145140

Cited in

(3)

• Depth in bucket recursive trees with variable capacities of buckets
• Branches in bucket recursive trees with variable capacities of buckets
• Labels distance in bucket recursive trees with variable capacities of buckets

This page was built for publication: The subtree size profile of bucket recursive trees

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