On 2-protected nodes in random digital trees
From MaRDI portal
Publication:5964078
DOI10.1016/j.tcs.2016.02.007zbMath1336.68047OpenAlexW2252485372MaRDI QIDQ5964078
No author found.
Publication date: 26 February 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.007
Related Items (3)
Normal Limit Law for Protected Node Profile of Random Recursive Trees ⋮ Asymptotic expectation of protected node profile in random digital search trees ⋮ On a random search tree: asymptotic enumeration of vertices by distance from leaves
Cites Work
- \(k\)-protected vertices in binary search trees
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries
- Notes on protected nodes in digital search trees
- Protected points in \(k\)-ary trees
- Mellin transforms and asymptotics: Harmonic sums
- On the variance of a class of inductive valuations of data structures for digital search
- Asymptotic distribution of two-protected nodes in random binary search trees
- Protected nodes and fringe subtrees in some random trees
- Protected points in ordered trees
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Limit laws for functions of fringe trees for binary search trees and random recursive trees
- Asymptotic distribution of two-protected nodes in ternary search trees
- Asymptotic variance of random symmetric digital search trees
- The Variance of the Number of 2-Protected Nodes in a Trie
- Asymptotic Properties of Protected Nodes in Random Recursive Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On 2-protected nodes in random digital trees
