Abstract
In this paper, we investigate leaves for random paged digital search trees, an important and generalized version of digital search trees.
This is a preview of subscription content, log in via an institution to check access.
References
Flajolet P, Gourdon X, Dumas P (1995) Mellin transforms and asymptotics: harmonic sums. Theor Comput Sci 144:3–58 (Special volume on mathematical analysis of algorithms)
Flajolet P, Gourdon X, Martinez C (1997) Patterns in random binary search trees. Random Struct Algorithms 11:223–244
Hwang HK, Fuchs M, Zacharovas V (2010) Asymptotic variance of random symmetric digital search trees. Discrete Math Theor Comput Sci 12:103–166
Jacquet P, Szpankowski W (1998) Analytical de-poissonization and its applications. Theor Comput Sci 201:1–62
Knuth DE (1998) The art of computer programming: sorting and searching, vol 3. Addison-Wesley, Boston
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Javanian, M. Leaves in a Particular Class of Trees. Natl. Acad. Sci. Lett. 42, 441–444 (2019). https://doi.org/10.1007/s40009-018-0778-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40009-018-0778-z