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 Analysis of QUICKSELECT: an algorithm for order statistics – H M Mahmoud, R Modarres, R T Smythe - 1995
83 On a stochastic difference equation and a representation of non-negative infinitely divisible random variables – W Vervaat - 1979
33 Quicksort asymptotics – Svante Janson - 2002
96 A Limit Theorem for "Quicksort" – Uwe Rösler - 1999
38 Algorithm 65 – C A R Hoare - 1961
53 A limiting distribution of Quicksort – M Régnier - 1989
26 Asymptotic distribution theory for Hoare's selection algorithm – Rudolf Grübel, Uwe Rösler - 2003
215 Evolution of random search trees – H M Mahmoud - 1992
67 The contraction method for recursive algorithms – Uwe Rösler, Ludger Rüschendorf
9 Simulating Perpetuities – Luc Devroye - 1999
31 Perpetuities With Thin Tails – Charles M. Goldie, Rudolf Grübel - 1996
14 On the probabilistic worst-case time of "FIND" – Luc Devroye - 2001
696 Art of Computer Programming Volume 3: Sorting and Searching – D E Knuth - 1998
32 Stability of Perpetuities – Charles M. Goldie, Ross A. Maller - 2000
44 Phase Change of Limit Laws in the Quicksort Recurrence Under Varying Toll Functions – Hsien-Kuei Hwang, Ralph Neininger - 2001
5 Simulating the Dickman distribution – Luc Devroye, Omar Fawzi
6 A note on the approximation of perpetuities – Margarete Knape, Ralph Neininger - 2007
248 Mathematical analysis of algorithms – D E Knuth - 1971
15 The Number of Bit Comparisons Used by Quicksort: An Average-case Analysis – James Allen Fill, Svante Janson - 2003