The expected profile of digital search trees
From MaRDI portal
Publication:549244
DOI10.1016/j.jcta.2011.04.001zbMath1233.68127OpenAlexW2117773253MaRDI QIDQ549244
Wojciech Szpankowski, Michael Drmota
Publication date: 7 July 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2011.04.001
Mellin transformgenerating functionsanalysis of algorithmssaddle point methoddigital search treesanalytic combinatoricsrecurrencespoissonizationtree profiles
Related Items (5)
Limit Theorems for Subtree Size Profiles of Increasing Trees ⋮ Node profiles of symmetric digital search trees: Concentration properties ⋮ Asymptotic expectation of protected node profile in random digital search trees ⋮ Profiles of PATRICIA tries ⋮ Asymmetric Rényi Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mellin transforms and asymptotics: Harmonic sums
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- Width and mode of the profile for some random trees of logarithmic height
- Asymptotical growth of a class of random trees
- Analytical depoissonization and its applications
- A characterization of digital search trees from the successful search viewpoint
- A study of trie-like structures under the density model
- Special issue: Average-case analysis of algorithms
- A note on growing binary trees
- Random Trees
- Profiles of Tries
- Paths in a random digital tree: limiting distributions
- Exact and asymptotic distributions in digital and binary search trees
- Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme
- Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
- Average profile of the Lempel-Ziv parsing scheme for a Markovian source
This page was built for publication: The expected profile of digital search trees
