On a multivariate contraction method for random recursive structures with applications to quicksort

Random Structures and Algorithms

Volumn 19, Issue 3-4, 2001, Pages 498-524

  Neininger, Ralph ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Analysis of algorithms; Contraction method; Median of (2t + 1); Multivariate limit law; Quicksort

Indexed keywords

EID: 0035539864     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10010     Document Type: Article

References (51)

1. E.A. Bender and L.B. Richmond, Central and local limit theorems applied to asymptotic enumeration. II. Multivariate generating functions, J Combin Theory Ser, A 34 (1983), 255-265.
2. P.J. Bickel and P.A. Freedman, Some asymptotic theory for the bootstrap, Ann Statist 9 (1981), 1196-1217.
3. V. Bruhn, Eine Methode zur asymptotischen Behandlung einer Klasse von Rekursionsglcichungen mit einer Anwendung in der stochastischen Analyse des Quicksort-Algorithmus, Ph.D. Thesis, Universität Kiel, 1996.
4. 2 convergence theorem for random affine mappings, J Appl Prohab 32 (1995), 183-192.
5. H.-H. Chern and H.-K. Hwang, Transitional behaviors of the average cost of Quicksort with median-of-(2t + 1), Algorithmica 29 (2001), 44-69.
6. M. Cramer and L. Rüschendorf, Convergence of two-dimensional branching recursions, J Comput Appl Math 130 (2001), 53-73.
7. G. Dall'Aglio, Sugli estremi dei momenti delle funzioni di ripartizione doppia, Ann Scuoloa Norm Sup Pisa 10 (3) (1956), 35-74.
8. L. Devroye, "Branching processes and their applications in the analysis of tree structures and tree algorithms," Probabilistic methods for algorithmic discrete mathematics, Springer, Berlin, 1998, pp. 249-314.
9. L. Devroye, Universal limit laws for the depths in random trees, SIAM J Comput 28 (1998), 409-432.
10. L. Devroye and L. Laforest, An analysis of random d-dimensional quad trees, SIAM J Comput 19 (1990), 821-832.
11. C.J.H. McDiarmid and R.B. Hayward, Large deviations for Quicksort, J Algorithms 21 (1996), 476-507.
12. M.H. van Emden, Increasing the efficiency of quicksort, Commun ACM 13 (1970), 563-567.
13. R. Finkel and J. Bentley, Quad trees, a data structure for retrieval on composite keys Acta Inform 4 (1974), 1-9.
14. P. Flajolet, G. Gonnet, C. Puech, and J. Robson, Analytic variations on quadtrees, Algorithmica 10 (1993), 473-500.
15. P. Flajolet, G. Labelle, L. Laforest, and B. Salvy, Hypergeometrics and the cost structure of quadtrees, Random Structures Algorithms 7 (1995), 117-144.
16. P. Flajolet and T. Lafforgue, Search costs in quadtrees and singularity perturbation asymptotics, Discrete Comput Geom 12 (1994), 151-175.
17. P. Flajolet and C. Puech, Partial match retrieval of multidimensional data, J ACM 33 (1986), 371-407.
18. Z. Gao and L.B. Richmond, Central and local limit theorems applied to asymptotic enumeration. IV. Multivariate generating functions, J Comput Appl Math 41 (1992), 177-186.
19. J. Geiger, "A new proof of Yaglom's exponential limit law," Mathematics and computer science (Versailles), Birkhäuser, Basel, 2000, pp. 245-249.
20. G.H. Gonnet and R. Baeza-Yates, Handbook of algorithms and data structures: In Pascal and C (2nd ed.), Addison-Wesley, Reading, MA, 1991.
21. D.H. Green, Labelled formal languages and their uses, Ph.D. Thesis, Stanford University, 1983.
22. P. Hennequin, Combinatorial analysis of quicksort algorithm, RAIRO Inform Théor Appl 23 (1989), 317-333.
23. P. Hennequin, Analyse en moyenne d'algorithme, tri rapide et arbres de recherche Ph.D. Thesis, L'École Polytechnique, 1991.
24. H. Hurwitz, Jr., On the probability distribution of the values of binary trees. Comm ACM 14 (1971), 99-102.
25. H.-K. Hwang and R. Neininger, Phase change of limit laws in the quicksort recurrence under varying toll functions. Preprint, 2001.
26. W. Lew and H.M. Mahmoud, The joint distribution of elastic buckets in multiway search trees, SIAM J Comput 23 (1994), 1050-1074.
27. H.M. Mahmoud, Evolution of random search trees, Wiley, New York, 1992.
28. H.M. Mahmoud, Sorting, a distribution theory, Wiley-Interscience, New York, 2000.
29. H.M. Mahmoud and B. Pittel, On the joint distribution of the insertion path length and the number of comparisons in search trees, Discrete Appl Math 20 (1988), 243-251.
30. H.M. Mahmoud and R.T. Smythe, Asymptotic joint normality of outdegrees of nodes in random recursive trees, Random Structures Algorithms 3 (1992), 255-266.
31. H.M. Mahmoud, R.T Smythe, and J. Szymański, On the structure of random plane-oriented recursive trees and their branches, Random Structures Algorithms 4 (1993), 151-176.
32. P. Major, On the invariance principle for sums of independent identically distributed random variables, J Multivariate Anal 8 (1978), 487-517.
33. C. Martínez and S. Roura, Optimal sampling strategies in Quicksort and Quickselect, SIAM J Comput, to appear.
34. R. Neininger, Limit laws for random recursive structures and algorithms, Ph.D. Thesis, Universität Freiburg, 1999.
35. R. Neininger, Asymptotic distributions for partial match queries in K-d trees, Random Structures Algorithms 17 (2000), 403-427.
36. R. Neininger, On the Wiener index in random trees 2001, in preparation.
37. R. Neininger and L. Rüschendorf, On the internal path length of d-dimensional quad trees, Random Structures Algorithms 15 (1999), 25-41.
38. R. Neininger and L. Rüschendorf, Limit laws for partial match queries in quadtrees Ann Appl Probab, to appear.
39. S.T. Rachev, Probability metrics and the stability of stochastic models, John Wiley, 1991.
40. S.T Rachev and L. Rüschendorf, Probability metrics and recursive algorithms, Adv in Appl Probab 27 (1995), 770-799.
41. S.T Rachev and L. Rüschendorf, Mass transportation problems, vol. I: Theory, Springer-Verlag, New York, 1988.
42. M. Régnier, A limiting distribution for quicksort, RAIRO Inform Théor Appl 23 (1989), 335-343.
43. U. Rösler, A limit theorem for "Quicksort," RAIRO Inform Théor Appl 25 (1991), 85-100.
44. U. Rösler, A fixed point theorem for distributions, Stochastic Process Appl 42 (1992), 195-214.
45. U. Rösler, On the analysis of stochastic divide and conquer algorithms, Algorithmica 29 (2001), 238-261.
46. U. Rösler and L. Rüschendorf, The contraction method for recursive algorithms, Algorithmica 29 (2001), 3-33.
47. H. Samet, Applications of spatial data structures: Computer graphics, image processing, and GIS, Addison-Wesley, Reading, MA, 1990a.
48. H. Samet, The design and analysis of spatial data structures, Addison-Wesley, Reading, MA, 1990b.
49. R. Sedgewick, Quicksort. Stanford Computer Science Report STAN-CS-75-492, Ph.D. Thesis, Stanford University, 1975.
50. R. Sedgewick, The analysis of Quicksort programs, Acta Informat 7 (1977), 327-355.
51. K.H. Tan and P. Hadjicostas, Some properties of a limiting distribution in Quicksort, Statist Probab Lett 25 (1995), 87-94.