On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach
From MaRDI portal
Publication:1575544
DOI10.1016/S0304-3975(98)00213-8zbMath0944.68072MaRDI QIDQ1575544
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Cites Work
- Mellin transforms and asymptotics: Harmonic sums
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- On the variance of a class of inductive valuations of data structures for digital search
- A characterization of digital search trees from the successful search viewpoint
- On The variance of the extremal path length in a symmetric digital trie
- Asymptotic analysis of a class of functional equations and applications
- A note on growing binary trees
- Singularity Analysis of Generating Functions
- Digital Search Trees Revisited
- Generalized Digital Trees and Their Difference—Differential Equations
- Digital Search Trees Again Revisited: The Internal Path Length Perspective
- File structures using hashing functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
