Analysis of Algorithms by the Contraction Method: Additive and Max-recursive Sequences

[1]  Uwe Rösler,et al.  On the analysis of stochastic divide and conquer algorithms , 2001, Algorithmica.

[2]  R. Neininger,et al.  On the contraction method with degenerate limit equation , 2004, math/0410177.

[3]  L. Rüschendorf,et al.  A general limit theorem for recursive algorithms and combinatorial structures , 2004 .

[4]  Ludger Rüschendorf,et al.  Rates of convergence for Quicksort , 2002, J. Algorithms.

[5]  Hsien-Kuei Hwang,et al.  Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions , 2002, SIAM J. Comput..

[6]  Ralph Neininger,et al.  On a multivariate contraction method for random recursive structures with applications to Quicksort , 2001, Random Struct. Algorithms.

[7]  Ralph Neininger,et al.  Limit laws for random recursive structures and algorithms , 1999 .

[8]  Uwe Rr Osler.  The Contraction Method for Recursive Algorithms , 1999 .

[9]  Vladimir M. Zolotarev,et al.  Modern Theory of Summation of Random Variables , 1997 .

[10]  M. Cramer.  Stochastic analysis of the Merge-Sort algorithm , 1997 .

[11]  S. Rachev,et al.  Probability metrics and recursive algorithms , 1995, Advances in Applied Probability.

[12]  S. Rachev,et al.  Rate of Convergence for Sums and Maxima and Doubly Ideal Metrics , 1993 .

[13]  U. Rösler.  A fixed point theorem for distributions , 1992 .

[14]  J. Freeman.  Probability Metrics and the Stability of Stochastic Models , 1991 .

[15]  U. Rösler.  A limit theorem for "Quicksort" , 1991, RAIRO Theor. Informatics Appl..

[16]  Mireille Régnier.  A Limiting Distribution for Quicksort , 1989, RAIRO Theor. Informatics Appl..

[17]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[18]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[19]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .