Size and path length of Patricia tries: Dynamical sources context
From MaRDI portal
Publication:2772922
DOI10.1002/rsa.10015zbMath1016.68029OpenAlexW2160022484MaRDI QIDQ2772922
Publication date: 14 May 2002
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10015
Related Items (6)
A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries ⋮ Gaussian Distribution of Trie Depth for Strongly Tame Sources ⋮ Management and analysis of DNA microarray data by using weighted trees ⋮ A weakly 1-stable distribution for the number of random records and cuttings in split trees ⋮ The fluctuations of the giant cluster for percolation on random split trees ⋮ Renewal theory in the analysis of tries and strings
Cites Work
- Unnamed Item
- Unnamed Item
- Mellin transforms and asymptotics: Harmonic sums
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- On the performance evaluation of extendible hashing and trie searching
- On the balance property of Patricia tries: External path length viewpoint
- Continued fraction algorithms, functional operators, and structure constants
- Analytical depoissonization and its applications
- A study of trie-like structures under the density model
- La théorie de Fredholm
- Patricia tries again revisited
- A complex Ruelle-Perron-Frobenius theorem and two counterexamples
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Algorithms on Strings, Trees and Sequences
- Limiting Distribution for the Depth in PATRICIA Tries
- Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems
This page was built for publication: Size and path length of Patricia tries: Dynamical sources context
