A logarithmic time sort for linear size networks
暂无分享,去创建一个
[1] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[2] Journal of the Association for Computing Machinery , 1961, Nature.
[3] D. V. Cheesman. A Small Business Computer at Work , 1962, Comput. J..
[4] J. Darroch. On the Distribution of the Number of Successes in Independent Trials , 1964 .
[5] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.
[6] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .
[7] L. Gleser. On the Distribution of the Number of Successes in Independent Trials , 1975 .
[8] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..
[9] Daniel S. Hirschberg. Fast parallel sorting algorithms , 1978, CACM.
[10] Franco P. Preparata,et al. New Parallel-Sorting Schemes , 1978, IEEE Transactions on Computers.
[11] Franco P. Preparata,et al. The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[12] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.
[13] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.
[14] Franco P. Preparata,et al. The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[15] Rüdiger Reischuk,et al. A fast probabilistic parallel sorting algorithm , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[16] Sartaj Sahni,et al. Parallel permutation and sorting algorithms and a new generalized connection network , 1982, JACM.
[17] Efficient schemes for parallel communication , 1982, PODC '82.
[18] Leslie G. Valiant,et al. A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..
[19] Romas Aleliunas,et al. Randomized parallel communication (Preliminary Version) , 1982, PODC '82.
[20] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.
[21] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .
[22] Frank Thomson Leighton,et al. Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.
[23] Debasis Mitra,et al. Randomized Parallel Communications , 1986, ICPP.