DEGREE PROFILE OF m-ARY SEARCH TREES: A VEHICLE FOR DATA STRUCTURE COMPRESSION
From MaRDI portal
Publication:5358070
DOI10.1017/S0269964815000303zbMath1420.68080arXiv1405.2471MaRDI QIDQ5358070
Ravi Kalpathy, Hosam M. Mahmoud
Publication date: 19 September 2017
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.2471
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notes on protected nodes in digital search trees
- Protected points in \(k\)-ary trees
- Asymptotic distribution of two-protected nodes in random binary search trees
- Protected nodes and fringe subtrees in some random trees
- On the degree distribution of the nodes in increasing trees
- Central limit theorems for urn models
- Protected points in ordered trees
- Asymptotic distribution of two-protected nodes in ternary search trees
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Limit laws for local counters in random binary search trees
- Analysis of the space of search trees under the random insertion algorithm
- m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements
- Asymptotic degree distribution in random recursive trees
- Asymptotic Properties of Protected Nodes in Random Recursive Trees
- Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
This page was built for publication: DEGREE PROFILE OF m-ARY SEARCH TREES: A VEHICLE FOR DATA STRUCTURE COMPRESSION
