On the Variance of Quickselect
暂无分享,去创建一个
[1] Rudolf Grübel,et al. On the median-of-K version of Hoare's selection algorithm , 1999, RAIRO Theor. Informatics Appl..
[2] N. Bleistein,et al. Asymptotic Expansions of Integrals , 1975 .
[3] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science (2. ed.) , 1994 .
[4] H. Prodinger,et al. Analysis of Hoare's FIND algorithm with median-of-three partition , 1997 .
[5] Helmut Prodinger,et al. Analysis of Hoare's FIND algorithm with Median-of-three partition , 1997, Random Struct. Algorithms.
[6] Irene A. Stegun,et al. Handbook of Mathematical Functions. , 1966 .
[7] C. SIAMJ.. OPTIMAL SAMPLING STRATEGIES IN QUICKSORT AND QUICKSELECT , 2001 .
[8] Conrado Martínez,et al. Optimal Sampling Strategies in Quicksort and Quickselect , 2002, SIAM J. Comput..
[9] Alfredo Viola,et al. Adaptive sampling for quickselect , 2004, SODA '04.
[10] Donald E. Knuth,et al. Mathematical Analysis of Algorithms , 1971, IFIP Congress.
[11] Helmut Prodinger,et al. Comparisons in Hoare's Find Algorithm , 1998, Combinatorics, Probability and Computing.