On the richness of the collection of subtrees in random binary search trees
From MaRDI portal
Publication:293237
DOI10.1016/S0020-0190(97)00206-8zbMATH Open1339.68051OpenAlexW2127892269MaRDI QIDQ293237FDOQ293237
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097002068?np=y
Recommendations
- On the subtrees of random binary search trees
- On the subtree size profile of binary search trees
- Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
- On the largest common subtree of random leaf-labeled binary trees
- Limit laws for functions of fringe trees for binary search trees and random recursive trees
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Negative association of random variables, with applications
- Weighted sums of certain dependent random variables
- Deviations from uniformity in random strings
- Limit laws for local counters in random binary search trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
- Simplifications of Uniform Expressions Specified by Systems
- Title not available (Why is that?)
- The Expected Distribution of Degrees in Random Binary Search Trees
- On the subtrees of random binary search trees
- Distinct fringe subtrees in random trees
- Compaction for two models of logarithmic‐depth trees: Analysis and experiments
- A note on subtrees rooted along the primary path of a binary tree
- Limit theorems for subtree size profiles of increasing trees
This page was built for publication: On the richness of the collection of subtrees in random binary search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293237)
