Parallel Divide and Conquer
暂无分享，去创建一个
[1] V. Strassen. Gaussian elimination is not optimal , 1969 .
[2] Alan R. Jones,et al. Fast Fourier Transform , 1970, SIGP.
[3] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[4] William H. Press,et al. Numerical Recipes in FORTRAN - The Art of Scientific Computing, 2nd Edition , 1987 .
[5] Per Brinch Hansen. A Generic Multiplication Pipeline , 1991 .
[6] G. C. Fox,et al. Solving Problems on Concurrent Processors , 1988 .
[7] Ellis Horowitz,et al. Fundamentals of Computer Algorithms , 1978 .
[8] Piet Hut,et al. A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.
[9] Per Brinch Hansen. THE ALL-PAIRS PIPELINE , 1990 .
[10] C. A. R. Hoare,et al. Proof of a Recursive Program: Quicksort , 1971, Comput. J..
[11] S. K. Park,et al. Random number generators: good ones are hard to find , 1988, CACM.
[12] C. A. R. Hoare,et al. Algorithm 64: Quicksort , 1961, Commun. ACM.
[13] Michael Ian Shamos,et al. Divide-and-conquer in multidimensional space , 1976, STOC '76.
[14] William F. Eddy,et al. A New Convex Hull Algorithm for Planar Sets , 1977, TOMS.
[15] Per Brinch Hansen. Balancing a Pipeline by Folding , 1990 .