On the height of digital trees and related problems
- 1 June 1991
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 6 (2), 256-277
- https://doi.org/10.1007/bf01759045
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Self-alignments in words and their applicationsJournal of Algorithms, 1992
- Paths in a random digital tree: limiting distributionsAdvances in Applied Probability, 1986
- Asymptotical Growth of a Class of Random TreesThe Annals of Probability, 1985
- The Myriad Virtues of Subword TreesPublished by Springer Nature ,1985
- A probabilistic analysis of the height of tries and of the complexity of triesortActa Informatica, 1984
- On the performance evaluation of extendible hashing and trie searchingActa Informatica, 1983
- On the average height of trees in digital search and dynamic hashingInformation Processing Letters, 1981
- A note on the analysis of extendible hashingInformation Processing Letters, 1980
- Tree algorithms for packet broadcast channelsIEEE Transactions on Information Theory, 1979
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979