The expected profile of digital search trees
type: Item
instance of: scholarly article
title: The expected profile of digital search trees
zbMATH Open document ID: 1233.68127
author: Michael Drmota
author: Wojciech Szpankowski
published in: Journal of Combinatorial Theory. Series A
publication date: 2011-07-07T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5918276
zbMATH Keywords: digital search trees
zbMATH Keywords: tree profiles
zbMATH Keywords: analytic combinatorics
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: recurrences
zbMATH Keywords: generating functions
zbMATH Keywords: poissonization
zbMATH Keywords: Mellin transform
zbMATH Keywords: saddle point method
MaRDI profile type: Publication
full work available at URL: j.jcta.2011.04.001
OpenAlex ID: W2117773253
cites work: A study of trie-like structures under the density model
cites work: Width and mode of the profile for some random trees of logarithmic height
cites work: Random Trees
cites work: Mellin transforms and asymptotics: Harmonic sums
cites work: Q4828543
cites work: Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
cites work: Analytical depoissonization and its applications
cites work: Average profile of the Lempel-Ziv parsing scheme for a Markovian source
cites work: Q3742733
cites work: Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme
cites work: Q3565419
cites work: Q4349924
cites work: A note on growing binary trees
cites work: Q4681771
cites work: Exact and asymptotic distributions in digital and binary search trees
cites work: Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
cites work: Q4004056
cites work: Profiles of Tries
cites work: Asymptotical growth of a class of random trees
cites work: Paths in a random digital tree: limiting distributions
cites work: Q4436358
cites work: A characterization of digital search trees from the successful search viewpoint
cites work: Special issue: Average-case analysis of algorithms
DOI: 10.1016/J.JCTA.2011.04.001
description: scientific article; zbMATH DE number 5918276