Subject
General Computer Science,Theoretical Computer Science
Reference12 articles.
1. Sorting in c log n parallel steps;Ajtai;Combinatorica,1983
2. K.E. Batcher, Sorting networks and their applications, Proc. AFIPS Spring Joint Computer Conf., 1968, vol. 32, pp. 307–314
3. K.E. Batcher, K.J. Liszka, A modulo merge sorting network, in: Fourth Symposium on the Frontiers of Massively Parallel Computation, 1992, pp. 164–169
4. G. Even, T. Levy, A. Litman, Optimal conclusive sets for comparator networks, Structural Information and Communication Complexity, 2007, pp. 304-317, Theoretical Computer Science, in press (doi:10.1016/j.tcs.2008.12.021)
5. M.W. Green, Cellular Logic in Memory Arrays, Final Report, SRI Project 5509, Part 1, Stanford Research Institute, 1970, pp. 49–71
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献