Dynamical sources in information theory: A general analysis of trie structures
- 1 February 2001
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 29 (1-2) , 307-369
- https://doi.org/10.1007/bf02679623
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- An Average-Case Analysis of the Gaussian Algorithm for Lattice ReductionCombinatorics, Probability and Computing, 1997
- Algorithms for computing signs of 2 x 2 determinants: Dynamics and average-case analysisPublished by Springer Nature ,1997
- An Introduction to Symbolic Dynamics and CodingPublished by Cambridge University Press (CUP) ,1995
- Quantum maps from transfer operatorsPhysica D: Nonlinear Phenomena, 1993
- A Study of Trie-Like Structures Under the Density ModelThe Annals of Applied Probability, 1992
- A probabilistic analysis of the height of tries and of the complexity of triesortActa Informatica, 1984
- A complex Ruelle-Perron-Frobenius theorem and two counterexamplesErgodic Theory and Dynamical Systems, 1984
- Self-Organizing Binary Search TreesJournal of the ACM, 1978
- An Analysis of Binary Search Trees Formed from Sequences of Nondistinct KeysJournal of the ACM, 1976
- Randomized binary searching with tree structuresCommunications of the ACM, 1964