The subtree size profile of bucket recursive trees
From MaRDI portal
Publication:2834862
DOI10.7508/IJMSI.2016.01.001zbMATH Open1350.05016OpenAlexW2344551300MaRDI QIDQ2834862FDOQ2834862
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
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)
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)