Stochastic analysis of the Merge-Sort algorithm

Random Structures and Algorithms

Volumn 11, Issue 1, 1997, Pages 81-96

  Cramer, M ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Contraction method; Ideal metrics; Merge Sort

Indexed keywords

EID: 0031480862     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199708)11:1<81::AID-RSA3>3.0.CO;2-Q     Document Type: Article

References (7)

1. M. Cramer, Stochastische Analyse rekursiver Algorithmen mit idealen Metriken, Dissertation, Universität Freiburg, 1995.
2. G. H. Gonnet, Handbook of Algorithms and Data Structures, Addison-Wesley, Reading, MA, 1984.
3. D. E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading MA, 1973.
4. M. Maejima and S. T. Rachev, An ideal metric and the rate of convergence to a self similar process, Ann. Probab., 15, 708-727 (1987).
5. S. T. Rachev, Minimal metrics in the random variable space, Publ. Inst. Stat. Univ. Paris, XXVII, 27-47 (1982).
6. S. T. Rachev, Probability Metrics and the Stability of Stochastic Models, Wiley, New York, 1991.
7. S. T. Rachev and L. Rüschendorf, Probability metrics and recursive algorithms, Adv. Appl. Probab. 27, 770-799 (1995).