New results on the size of tries
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (1) , 203-205
- https://doi.org/10.1109/18.42197
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Trie partitioning process: Limiting distributionsPublished by Springer Nature ,2005
- Paths in a random digital tree: limiting distributionsAdvances in Applied Probability, 1986
- Q-ary collision resolution algorithms in random-access systems with free or blocked channel accessIEEE Transactions on Information Theory, 1985
- Analysis of a stack algorithm for random multiple-access communicationIEEE Transactions on Information Theory, 1985
- Algebraic Methods for Trie StatisticsNorth-Holland Mathematics Studies, 1985
- Some Uses of the Mellin Integral Transform in the Analysis of AlgorithmsPublished by Springer Nature ,1985
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979