Tight Bounds on the Complexity of Parallel Sorting
暂无分享,去创建一个
[1] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.
[2] Harold S. Stone,et al. Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.
[3] C. Thompson. Area-time complexity for VLSI , 1979, STOC 1979.
[4] Douglas Stott Parker,et al. Notes on Shuffle/Exchange-Type Switching Networks , 1980, IEEE Transactions on Computers.
[5] F. Leighton. New lower bound techniques for VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[6] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.
[7] Richard J. Lipton,et al. Lower bounds for VLSI , 1981, STOC '81.
[8] A logarithmic time sort for linear size networks , 1982, STOC 1983.
[9] Allan Borodin,et al. Routing, merging and sorting on parallel models of computation , 1982, STOC '82.
[10] Thompson. The VLSI Complexity of Sorting , 1983, IEEE Transactions on Computers.
[11] Frank Thomson Leighton,et al. Parallel Computation Using Meshes of Trees , 1983, WG.
[12] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.
[13] Franco P. Preparata,et al. An Architecture for Bitonic Sorting with Optimal VLSI Performnance , 1984, IEEE Transactions on Computers.
[14] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .
[15] Franco P. Preparata,et al. A minimum area VLSI network for O(logn) time sorting , 1984, STOC '84.
[16] Franco P. Preparata,et al. The VLSI Optimality of the AKS Sorting Network , 1985, Inf. Process. Lett..
[17] Leslie G. Valiant,et al. A logarithmic time sort for linear size networks , 1982, STOC.