A multivariate view of random bucket digital search trees

Journal of Algorithms

Volumn 44, Issue 1, 2002, Pages 121-158

  Hubalek, Friedrich ^a   Hwang, Hsien Kuei ^b   Lew, William ^c   Mahmoud, Hosam ^d   Prodinger, Helmut ^e  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

^c US General Accounting Office   (United States)

^d GEORGE WASHINGTON UNIVERSITY   (United States)

^e UNIVERSITY OF THE WITWATERSRAND   (South Africa)

Author keywords

Asymptotic normality; Bucketing; Euler transform; Mellin transform; Probabilistic analysis of algorithms; Random trees; Searching; Singularity analysis

Indexed keywords

ALGORITHMS; MATHEMATICAL TRANSFORMATIONS; METHOD OF MOMENTS; PROBABILITY; STORAGE ALLOCATION (COMPUTER);

DIGITAL SEARCH TREES;

TREES (MATHEMATICS);

EID: 0036659896     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00210-9     Document Type: Article

References (41)

1. R.A. Baeza-Yates, Some average measures in m-ary search trees, Inform. Process. Lett. 25 (1987) 375-381.
2. +-trees with partial expansions, IEEE Trans. Knowledge Data Engrg. 1 (1989) 248-257.
3. Z.-D. Bai, H.-K. Hwang, W.-Q. Liang, T.-H. Tsai, Limit theorems for the number of maxima in random samples from planar regions, Electron. J. Probab. 6 (3) (2001), 41 pp. (electronic).
4. P. Billingsley, Probability and Measure, third ed., Wiley, New York, 1995.
5. W.-M. Chen, H.-K. Hwang, Analysis of two randomized algorithms for finding the maximum in a broadcast communication model, 2001. Submitted.
6. H.-H. Chern, H.-K. Hwang, Phase changes in random m-ary search trees and generalized quicksort, Random Structures Algorithms 19 (2000) 316-358.
7. R. Cools, D. Laurie, L. Pluym, Algorithm 764: CUBPACK++: A C++ package for automatic two-dimensional cubature, ACM Trans. Math. Softw. 23 (1997) 1-15.
8. L. Devroye, Lecture Notes on Bucket Algorithms, Birkhäuser Boston, Boston, MA, 1986.
9. G. Doetsch, Theorie der Laplace-Transformation, in: Handbuch der Laplace-Transformation. Band I, Birkhäuser, Basel, 1971, Verbesserter Nachdruck der ersten Auflage 1950, Lehrbücher und Monographien aus dem Gebiete der exakten Wissenschaften. Mathematische Reihe, Band 14.
10. G. Doetsch, Theorie der Laplace-Transformation, in: Handbuch der Laplace-Transformation. Band I, Birkhäuser, Basel, 1971, Verbesserter Nachdruck der ersten Auflage 1950, Lehrbücher und Monographien aus dem Gebiete der exakten Wissenschaften. Mathematische Reihe, Band 14.
11. G. Doetsch, Anwendungen der Laplace-Transformation. 1. Abteilung, in: Handbuch der Laplace-Transformation, Band II, Birkhäuser, Basel, 1972, Verbesserter Nachdruck der ersten Auflage 1955, Lehrbücher und Monographien aus dem Gebiete der exakten Wissenschaften. Mathematische Reihe, Band 15.
12. G. Doetsch, Anwendungen der Laplace-Transformation. 1. Abteilung, in: Handbuch der Laplace-Transformation, Band II, Birkhäuser, Basel, 1972, Verbesserter Nachdruck der ersten Auflage 1955, Lehrbücher und Monographien aus dem Gebiete der exakten Wissenschaften. Mathematische Reihe, Band 15.
13. P. Flajolet, X. Gourdon, P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoret. Comput. Sci. 144 (1995) 3-58, special volume on Mathematical Analysis of Algorithms.
14. P. Flajolet, A. Odlyzko, Singularity analysis of generating functions, SIAM J. Discrete Math. 3 (1990) 216-240.
15. P. Flajolet, B. Richmond, Generalized digital trees and their difference-differential equations, Random Structure Algorithms 3 (1992) 305-320.
16. G. Frederickson, Improving storage utilization in balanced trees, in: Proc. 17th Allerton Conf. Commun., Contr. and Comput., Monticello, IL, 1979, pp. 255-264.
17. G. Gonnet, R.A. Baeza-Yates, Handbook of Algorithms and Data Structures, second ed., Addison-Wesley, Reading, MA, 1991.
18. M. Hoshi, P. Flajolet, Page usage in a quadtree index, BIT 32 (1992) 384-402.
19. F. Hubalek, Beiträge zur Analyse verallgemeinerter digitaler Suchbäume, Dissertation, Vienna University of Technology, 1993.
20. F. Hubalek, On the variance of the internal path length of generalized digital trees - The Mellin convolution approach, Theoret. Comput. Sci. 242 (2000) 143-168.
21. F. Hubalek, Partial fractions and Mellin convolutions for the analysis of bucket digital search trees - Some numerical aspects, unpublished working paper, 2001.
22. H.-K. Hwang, Asymptotic estimates of elementary probability distributions, Stud. Appl. Math. 99 (1997) 393-417.
23. H.-K. Hwang, R. Neininger, Phase change of limit laws in the quicksort recurrence under varying toll functions, SIAM J. Comput. (2001), accepted.
24. H.-K. Hwang, T.-H. Tsai, Quickselect and Dickman function, Combin. Probab. Comput. (2000), to appear.
25. P. Jacquet, M. Régnier, Trie partitioning process: Limiting distributions, in: CAAP'86, Nice, 1986, Springer, Berlin, 1986, pp. 196-210.
26. P. Jacquet, M. Régnier, Normal limiting distribution of the size of tries, in: Performance'87, Brussels, 1987, North-Holland, Amsterdam, 1988, pp. 209-223.
27. P. Jacquet, W. Szpankowski, J. Tang, Average profile of the Lempel-Ziv parsing scheme for a Markovian source, Algorithmica 31 (2001) 318-360.
28. P. Kirschenhofer, H. Prodinger, B-tries: A paradigm for the use of number-theoretic methods in the analysis of algorithms, in: Contributions to General Algebra, Vol. 6, Hölder-Pichler-Tempsky, Vienna, 1988, pp. 141-154.
29. P. Kirschenhofer, H. Prodinger, W. Szpankowski, On the balance property of Patricia tries: External path length viewpoint, Theoret. Comput. Sci. 68 (1989) 1-17.
30. P. Kirschenhofer, H. Prodinger, W. Szpankowski, Digital search trees again revisited: The internal path length perspective, SIAM J. Comput. 23 (1994) 598-616.
31. D.E. Knuth, Sorting and Searching, in: The Art of Computer Programming, Vol. III, second ed., Addison-Wesley, Reading, MA, 1998.
32. W. Lew, A Probabilistic Analysis of m-ary and Digital Search Trees, Dissertation, The George Washington University, 1995.
33. W. Lew, H.M. Mahmoud, The joint distribution of elastic buckets in multiway search trees, SIAM J. Comput. 23 (1994) 1050-1074.
34. D.B. Lomet, Partial expansions for file organizations with an index, ACM Trans. Datab. Syst. 12 (1987) 65-84.
35. G. Louchard, W. Szpankowski, J. Tang, Average profile of the generalized digital search tree and the generalized Lempel-Ziv algorithm, SIAM J. Comput. 28 (1999) 904-934.
36. H. Mahmoud, P. Flajolet, P. Jacquet, M. Régnier, Analytic variations on bucket selection and sorting, Acta Inform. 36 (2000) 735-760.
37. H.M. Mahmoud, Evolution of Random Search Trees, Wiley, New York, 1992.
38. H.M. Mahmoud, T. Papadakis, A probabilistic analysis of fixed and elastic buckets in tries and Patricia trees, in: Proc. 13th Allerton Conf. Commun., Contr. and Comput., Monticello, IL, 1992, pp. 874-883.
39. R. Piessens, E. de Doncker-Kapenga, C.W. Überhuber, D.K. Kahaner, QUADPACK, Springer-Verlag, Berlin, 1983, a subroutine package for automatic integration.
40. B. Pittel, Paths in a random digital tree: Limiting distributions, Adv. Appl. Probab. 18 (1986) 139-155.
41. F.P. Preparata, M.I. Shamos, Computational Geometry, Springer-Verlag, New York, 1985, an Introduction.