An economical construction for sorting networks

AFIPS Conference Proceedings - 1974 National Computer Conference, AFIPS 1974

Volumn , Issue , 1974, Pages 921-927

  Van Voorhis, David C ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPARATOR CIRCUITS;

SORTING NETWORK;

COMPARATORS (OPTICAL);

EID: 33747657508     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1500175.1500347     Document Type: Conference Paper

References (14)

1. Batcher, K. E., ''Sorting Networks and their Applications," Proc. SJCC, 1968, pp. 307-314.
2. ; J ACM, Vol. 15, No. 1, Jan. 1959, pp. 159-163.
3. Shell, D. L., "A High Speed Sorting Procedure," CACM, Vol. 2, No. 7, July 1959, pp. 30-32.
4. Hoare, C. A. R., "Quicksort," Comp. J., Vol. 5, 1962, pp. 10-15.
5. Van Voorhis, D. C, "Toward a Lower Bound for Sorting Networks," in Complexity of Computer Computations. Plenum Press, 1972, pp. 119-129.
6. Drysdale, R. L., Sorting Networks which Generalize Batcher's Odd-even Merge, Honors Paper, Knox College, Galesburg, Illinois, May 1973.
7. Van Voorhis, D. C, A Generalization of the Divide-sort-merge Strategy for Sorting Networks, Technical Report No. 16, Digital Systems Laboratory, Stanford University, Stanford, California, August 1971.
8. Van Voorhis, D. C, Large [g,d] Sorting Networks, Technical Report No. 18, Digital Systems Laboratory, Stanford University, Stanford, California, August 1971.
9. Floyd, R. W. and D. E. Knuth, The Bose-Nelson Sorting Problem, CS Report 70-177, Stanford University, Stanford, California, November 1970.
10. Knuth, D. E., "Sorting and Searching," The Art of Computer Programming, Vol. 3, Addison-Wesley, 1973.
11. Green, M. W., "Some Improvements in Non-adaptive Sorting Algorithms," Proc. of the Sixth Annual Princeton Conference on Information Sciences and Systems, 1972, pp. 387-391.
12. Gale, D. and R. K. Karp, "A Phenomenon in the Theory of Sorting," IEEE Conference Record of the Eleventh Annual Symposium on Switching and Automata Theory, 1970, pp. 51-59.
13. Van Voorhis, D. C, An Economical Construction for Sorting Networks, Working Paper 16/A45 No. 1, IBM System Development Division, Los Gatos, California, January 1974.
14. Van Voorhis, D. C, A Lower Bound for Sorting Networks that Use the Divide-sort-merge Strategy, Technical Report No. 17, Digital Systems Laboratory, Stanford University, Stanford, California, August 1971.