Back to Search
Start Over
Further results on digital search trees
- Source :
- Theoretical Computer Science. (1-3):143-154
- Publisher :
- Published by Elsevier B.V.
-
Abstract
- In this paper distribution results are proved on the cost of insertion in digital search trees, (binary) tries and Patricia tries. A method from the calculus of finite differences is used to achieve asymptotic results.
- Subjects :
- Mathematical optimization
Theoretical computer science
General Computer Science
Distribution (number theory)
Optimal binary search tree
Weight-balanced tree
Finite difference
Binary number
Random binary tree
Theoretical Computer Science
Binary search tree
Ternary search tree
Computer Science(all)
Mathematics
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Issue :
- 1-3
- Database :
- OpenAIRE
- Journal :
- Theoretical Computer Science
- Accession number :
- edsair.doi.dedup.....a720a8551d0e176c4e4b4ef38125b525
- Full Text :
- https://doi.org/10.1016/0304-3975(88)90023-0