The evaluation of an alternative sum with applications to the analysis of some data structures☆
References (15)
Some results on V-ary asymmetric tries
J. Algorithms
(1988)- et al.
Handbook of Mathematical Functions
(1964) - et al.
Data Structures and Algorithms
(1983) On the performance evaluation of extendible hashing and trie searching
Acta Informatica
(1983)- et al.
The asymptotic evaluation of some alternative sums involving binomial coefficients
(March 1983) - et al.
Digital search trees revisited
SIAM J. Comput.
(1986) Applied and Computational Complex Analysis
(1977)
There are more references available in the full text version of this article.
Cited by (25)
An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
1998, Information Processing LettersExplicit and asymptotic formulae for the expected values of the order statistics of the Cantor distribution
1996, Statistics and Probability LettersMellin transforms and asymptotics: Finite differences and Rice's integrals
1995, Theoretical Computer ScienceAutocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
1994, Journal of Combinatorial Theory, Series AHow to select a loser
1993, Discrete MathematicsA note on binomial recurrences arising in the analysis of algorithms
1993, Information Processing Letters
- ☆
This research was partly supported by the National Science Foundation under Grant No. NCR-8702115.
Copyright © 1988 Published by Elsevier B.V.