Abstract
In the analysis of some data structures (e.g., digital search trees) one often meets with a binomial recurrence. This recurrence leads to a solution which has a form of an alternative sum, hence not very convenient for numerical computations. Nevertheless, this solution is useful in deriving asymptotic approximation for the sum. In this note we propose a general approach to derive such asymptotics by applying the residue theorem from the complex analysis. We illustrate our technique on some examples taken form the analysis of digital search trees.
This research was supported in part by the National Science Foundation under grant NCR - 8702115.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abramowitz, M., and Stegun, L., Handbook of mathematical functions, Dover, New York (1964).
Aho, A., Hopcroft, J., and Ullmann, J., Data structures and algorithms, Addison-Wesley (1983).
Flajolet, Ph., On the performance evaluation of extendible hashing and trie searching, Acta Informatica 20 (1983), 345–369.
Flajolet, Ph. and Sedgewick, R., Digital search trees revisited, SIAM J. Comput., 15 (1986), 748–767.
Flajolet, Ph. and Saheb, N., The complexity of generating an exponentially distributed variate, J. Algorithms, 7, (1987), 463–488.
Henrici, P., Applied and computational complex analysis, vol.1, John Wiley & Sons, New York (1977).
Hofri, M., Stack algorithms for collision-detecting channels and their analysis: A limited survey, Proceedings Intern. Seminar on Modeling and Performance Evaluation Methodology, Paris (1983), 53–78.
Kirschenhofer, P. and Prodinger, H., Some further results on digital trees, Proceedings of ICALP 86, Rennes, 1986.
Knuth, D., The art of computer programming. Sorting and searching, Addison-Wesley (1973).
Mathys, P. and Flajolet, Ph., Q-ary collision resolution algorithms in random-access systems with free and blocked channel access, IEEE Trans. Information Theory, vol. IT-31, (1985), 217–243.
Riordan, J., Combinatorial identities, John Wiley & Sons (1968).
Szpankowski, W., On a recurrence equation arising in the analysis of conflict resolution algorithms, Stochastic Models, 3, (1987).
Szpankowski, W., Solution of a linear recurrence equation arising in the analysis of some algorithms, SIAM J. Algebraic and Discrete Methods, 8, (1987), 233–250.
Szpankowski, W., Some results on V-ary asymmetric tries, Journal of Algorithms, 8, 1988.
Szpankowski, W., Two problems on the average complexity of digital trees, Proc. Intern. Conference PERFORMANCE'87, Brussels 1987, 189–208.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szpankowski, W. (1988). On an alternative sum useful in the analysis of some data structures. In: Karlsson, R., Lingas, A. (eds) SWAT 88. SWAT 1988. Lecture Notes in Computer Science, vol 318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_13
Download citation
DOI: https://doi.org/10.1007/3-540-19487-8_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19487-3
Online ISBN: 978-3-540-39288-0
eBook Packages: Springer Book Archive