Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter
From MaRDI portal
Publication:1202935
DOI10.1016/0304-3975(92)90262-EzbMath0850.68172MaRDI QIDQ1202935
Wojciech Szpankowski, Peter Kirschenhofer, Prodinger, Helmut
Publication date: 22 April 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the performance evaluation of extendible hashing and trie searching
- Asymptotical growth of a class of random trees
- Further results on digital search trees
- On the balance property of Patricia tries: External path length viewpoint
- Entropy and prefixes
- On The variance of the extremal path length in a symmetric digital trie
- On the computational power of pushdown automata
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
- Patricia tries again revisited
- Digital Search Trees Revisited
- Generalized Digital Trees and Their Difference—Differential Equations
- A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
- Asymptotic properties of data compression and suffix trees
