Digital Search Trees Again Revisited: The Internal Path Length Perspective
From MaRDI portal
Publication:4302286
DOI10.1137/S0097539790189368zbMath0819.68067MaRDI QIDQ4302286
Prodinger, Helmut, Wojciech Szpankowski, Peter Kirschenhofer
Publication date: 14 August 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
05C80: Random graphs (graph-theoretic aspects)
Related Items
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, Distances in random digital search trees, Analytical depoissonization and its applications, A general limit theorem for recursive algorithms and combinatorial structures, On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach