论文信息 - The Design and Analysis of a New Hybrid Sorting Algorithm - 字舞流文

The Design and Analysis of a New Hybrid Sorting Algorithm

Selim G. Akl | Henk Meijer | S. Akl | H. Meijer

[1] Wlodzimierz Dobosiewicz,et al. Sorting by Distributive Partitioning , 1978, Inf. Process. Lett..

[2] Franco P. Preparata,et al. Location of a Point in a Planar Subdivision and Its Applications , 1977, SIAM J. Comput..

[3] E. J. Gumbel,et al. Statistics of Extremes. , 1960 .

[4] Arnold Schönhage,et al. Finding the Median , 1976, J. Comput. Syst. Sci..

[5] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[6] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[7] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[8] Emanuel Parzen,et al. Modern Probability Theory And Its Applications , 1962 .

[9] Ivan Flores,et al. Computer Sorting , 1969 .

[10] Franco P. Preparata,et al. New Parallel-Sorting Schemes , 1978, IEEE Transactions on Computers.