Digital Search Trees Again Revisited: The Internal Path Length Perspective
- 1 June 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 23 (3), 598-616
- https://doi.org/10.1137/s0097539790189368
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- On some applications of formulae of Ramanujan in the analysis of algorithmsMathematika, 1991
- On the variance of the external path length in a symmetric digital trieDiscrete Applied Mathematics, 1989
- On the balance property of Patricia tries: External path length viewpointTheoretical Computer Science, 1989
- Ramanujan’s NotebooksPublished by Springer Nature ,1989
- A diffusion limit for a class of randomly-growing binary treesProbability Theory and Related Fields, 1988
- Further results on digital search treesTheoretical Computer Science, 1988
- Digital Search Trees RevisitedSIAM Journal on Computing, 1986
- Modular Functions and Dirichlet Series in Number TheoryPublished by Springer Nature ,1976
- A note on growing binary treesDiscrete Mathematics, 1973
- File structures using hashing functionsCommunications of the ACM, 1970