Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter
type: Item
instance of: scholarly article
title: Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter
zbMATH Open document ID: 0850.68172
DOI: 10.1016/0304-3975(92)90262-E
author: Peter Kirschenhofer
author: Wojciech Szpankowski
author: Helmut Prodinger
published in: Theoretical Computer Science
publication date: 1993-04-22T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 109479
MaRDI profile type: Publication
cites work: On the computational power of pushdown automata
cites work: Q3690245
cites work: On the performance evaluation of extendible hashing and trie searching
cites work: Generalized Digital Trees and Their Difference—Differential Equations
cites work: Digital Search Trees Revisited
cites work: Q4692507
cites work: Further results on digital search trees
cites work: On The variance of the extremal path length in a symmetric digital trie
cites work: On the balance property of Patricia tries: External path length viewpoint
cites work: Q4057549
cites work: Q4004056
cites work: Asymptotical growth of a class of random trees
cites work: Entropy and prefixes
cites work: Patricia tries again revisited
cites work: Asymptotic properties of data compression and suffix trees
cites work: A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
cites work: Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
description: scientific article; zbMATH DE number 109479