Quickselect and Dickman function (2000)

by Hsien-Kuei Hwang , Tsung-Hsi Tsai
Venue:Combinatorics, Probability and Computing
Citations:24 - 1 self

Documents Related by Co-Citation

29 R.T.: Analysis of QUICKSELECT: an algorithm for order statistics – H M Mahmoud, R Modarres, Smythe - 1995
98 A Limit Theorem for "Quicksort" – Uwe Rösler - 1999
33 Quicksort asymptotics – Svante Janson - 2002
27 Asymptotic distribution theory for Hoare's selection algorithm – Rudolf Grübel, Uwe Rösler - 2003
31 Perpetuities With Thin Tails – Charles M. Goldie, Rudolf Grübel - 1996
83 On a stochastic difference equation and a representation of non-negative infinitely divisible random variables – W Vervaat - 1979
53 A limiting distribution of Quicksort – M Régnier - 1989
68 The contraction method for recursive algorithms – Uwe Rösler, Ludger Rüschendorf
38 Smoothness and Decay Properties of the Limiting Quicksort Density Function – James Allen Fill, Svante Janson - 2000
32 Stability of Perpetuities – Charles M. Goldie, Ross A. Maller - 2000
38 Algorithm 65 – C A R Hoare - 1961
214 Evolution of Random Search Trees – Hosam M Mahmoud - 1992
9 Simulating Perpetuities – Luc Devroye - 1999
14 On the probabilistic worst-case time of "FIND" – Luc Devroye - 2001
46 Phase Change of Limit Laws in the Quicksort Recurrence Under Varying Toll Functions – Hsien-Kuei Hwang, Ralph Neininger - 2001
16 On the asymptotic distribution of large prime factors – Peter Donnelly, Geoffrey Grimmett - 1993
13 On distributional properties of perpetuities – Gerold Alsmeyer, Alex Iksanov, Uwe Rösler - 2008
5 Simulating the Dickman distribution – Luc Devroye, Omar Fawzi
15 The Number of Bit Comparisons Used by Quicksort: An Average-case Analysis – James Allen Fill, Svante Janson - 2003