The size of random bucket trees via urn models

Acta Informatica

Volumn 38, Issue 11-12, 2002, Pages 813-838

  Mahmoud, Hosam M ^a  

^a GEORGE WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; ENTROPY; MATHEMATICAL MODELS; RANDOM PROCESSES;

BINARY TREES; BUCKET QUAD TREES; BUCKET RECURSIVE TREES; POISSONIZATION;

TREES (MATHEMATICS);

EID: 0038095765     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00236-002-0096-1     Document Type: Article

References (35)

1. Aldous D, Flannery B, Palacios J (1988) Two applications of urn processes: The fringe analysis of search trees and the simulation of quasi-stationary distributions of Markov chains. Probab Eng Inform Sci 2 293-307
2. Athreya K, Karlin S (1968) Embedding of urn schemes into continuous time Markov branching process and related limit theorem. Ann Math Statistics 39 1801-1817
3. Athreya K, Key P (1972) Branching Processes. New York: Springer
4. Bagchi A, Pal A (1985) Asymptotic normality in the generalized Pólya-Eggenberger urn model with applications to computer data structures. SIAM J. on Algebraic Discrete Meth 6 394-405
5. Bentley J (1975) Multidimensional binary search trees used for associative searching. Communications of the ACM 18 509-517
6. Bernstein S (1940) Sur un problème du schème des urnes à composition variable. C R (Dokl) Acad Sci URSS 28 5-7
7. Chern H, Hwang H (2001) Phase change in random m-ary search trees and generalized quicksort. Random Struct Algorithms 19 316-358
8. Devroye L (1991) Limit laws for local counters in random binary search trees. Random Struct Algorithms 2 303-316
9. Devroye L (1999) Universal limit laws for depths in random trees. SIAM J Comput 28 409-432
10. Devroye L, Vivas A (1998) Random fringe-balanced quadtrees (manuscript)
11. Eggenberger F, Poĺya G (1923) Über die Statistik verketetter Vorgäge. Z Angew Math Mech 1 279-289
12. Finkel R, Bentley J (1974) Quad trees: a data structure for retrieval on composite keys. Acta Informatica 41-9
13. Flajolet P, Labelle G, Laforest L, Salvy B ( 1995) Hypergeometrics and the cost structure of quadtrees. Random Struct Algorithms 7 117-144
14. Gonnet G, Munro J (1984) The analysis of linear probing sort by the use of a new mathematical transform. J Algorithms 5 451-470
15. Hoshi M, Flajolet P (1992) Page usage in a quadtree index. BIT 32 384-402
16. Jacquet P, Régnier M (1986) Trie Partitioning process: limiting distributions. Lecture Notes in Computer Science, vol 214, pp 196-210. Berlin Heidelberg New York: Springer
17. Jacquet P, Szpankowski W (1998) Analytical depoissonization and its applications. Theor Comput Sci 201 1-62
18. Johnson N, Kotz S (1977) Urn models and their Applications. New York: Wiley
19. Lew L, Mahmoud H ( 1994) The joint distribution of elastic buckets in multiway search trees. SIAM J Comput 23 1050-1074
20. Knuth D ( 1998) The Art of Computer Programming, vol 3 : Sorting and Searching (2nd ed) Reading, Massachusetts: Addison-Wesley
21. Kotz S, Mahmoud H, Robert P (2000) On generalized Pólya urn models. Stat Probab Lett 49 163-173
22. Mahmoud H (1992) Evolution of Random Search Trees. New York: Wiley
23. Mahmoud H (1998) On rotations in fringe-balanced binary trees. Inform Process Lett 6541-46
24. Mahmoud H, Pittel B (1989) Analysis of the space of search trees under the random insertion algorithm. J Algorithms 10 52-75
25. Mahmoud H, Smythe R (1991) On the distribution of leaves in rooted subtrees of recursive trees. Ann Appl Probab 1 406-418
26. Mahmoud H, Smythe R (1992) Asymptotic joint normality of outdegrees of nodes in random recursive trees. Random Struct Algorithms 3 255-266
27. Mahmoud H, Smythe R (1995) Probabilistic analysis of bucket recursive trees. Theoret Comput Sci 144 221-249
28. Mahmoud H, Smythe R, Szymański J (1993) On the structure of plane-oriented recursive trees and their branches. Random Struct Algorithms 4 151-176
29. Pittel B (1998) Private Communication
30. Poblete P (1987) Approximating functions by their Poisson transform. Inform Process Lett 23 127-130
31. Samet H (1990) Applications of Spatial Data Structures. Reading, Mass: Addison-Wesley
32. Smiley M (1965) Algebra of Matrices. Boston, Mass: Allyn and Bacon
33. Smythe R (1996). Central limit theorems for urn models. Stochastic Processes Appl 65 115-137
34. Smythe R, Mahmoud H (1996) A survey of recursive trees. Theory of Probab Math Stat 51 1-29
35. Yao F (1990) Computational Geometry. In: van Leeuwen J (ed) Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pp 343-389. Amsterdam: MIT Press