Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. K.E. Batcher, Sorting Networks and their Applications, in: Proc. AFIPS Spring Joint Computer Conference, vol. 32 1968, pp. 307–314.
2. Optimal conclusive sets for comparators networks;Even;Theoretical Computer Science,2009
3. The Art of Computer Programming, vol. 3: Sorting and Searching;Knuth,1998
4. T. Levy, A. Litman, On fast bitonic sorters, Technical Report CS-2009-01, Technion, Department of Computer Science, 2009.
5. T. Levy, A. Litman, The strongest model of computation obeying 0-1 Principles, Theory of Computing Systems 48 (2) 374–388.