Scalable and Efficient Parallel Selection
暂无分享,去创建一个
[1] Mahmoud Fouz,et al. On Smoothed Analysis of Quicksort and Hoare’s Find , 2011, Algorithmica.
[2] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..
[3] H. Prodinger,et al. Analysis of Hoare's FIND algorithm with median-of-three partition , 1997 .
[4] C. A. R. Hoare,et al. Algorithm 64: Quicksort , 1961, Commun. ACM.
[5] W. Donald Frazer,et al. Samplesort: A Sampling Approach to Minimal Storage Tree Sorting , 1970, JACM.
[6] Jesper Larsson Träff,et al. Parallel Prefix (Scan) Algorithms for MPI , 2006, PVM/MPI.
[7] Yijie Han. Optimal parallel selection , 2003, SODA '03.
[8] William Gropp,et al. A Scalable MPI_Comm_split Algorithm for Exascale Computing , 2010, EuroMPI.
[9] Rolf Rabenseifner,et al. Optimization of Collective Reduction Operations , 2004, International Conference on Computational Science.
[10] Felix Wolf,et al. Parallel Sorting with Minimal Data , 2011, EuroMPI.
[11] C. A. R. Hoare. Algorithm 63: partition , 1961, CACM.