Trie partitioning process: limiting distributions
CAAP '86 Proceedings of the 11th colloquium on trees in algebra and programming
Limiting distribution for the depth in Patricia tries
SIAM Journal on Discrete Mathematics
Patricia tries again revisited
Journal of the ACM (JACM)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Size and path length of Patricia tries: dynamical sources context
Random Structures & Algorithms - Special issue on analysis of algorithms dedicated to Don Knuth on the occasion of his (100)8th birthday
Proceedings of the Fourth International Conference on Data Engineering
Normal Limiting Distribution of the Size of Tries
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Probability in the Engineering and Informational Sciences
Tunstall code, Khodak variations, and random walks
IEEE Transactions on Information Theory
Generalized Tunstall codes for sources with memory
IEEE Transactions on Information Theory
Second-order noiseless source coding theorems
IEEE Transactions on Information Theory
New results on the size of tries
IEEE Transactions on Information Theory
Analysis of a stack algorithm for random multiple-access communication
IEEE Transactions on Information Theory
Analysis of digital tries with Markovian dependency
IEEE Transactions on Information Theory
| Hi-index | 5.23 |
We give a survey of a number of simple applications of renewal theory to problems on random strings and tries: insertion depth, size, insertion mode and imbalance of tries; variations for b-tries and Patricia tries; Khodak and Tunstall codes.