A Super-Parallel Sorting Algorithm Based on Neural Networks

IEEE Transactions on Circuits and Systems

Volumn 37, Issue 11, 1990, Pages 1425-1429

  Takefuji, Yoshiyasu ^a   Lee, Kuo Chun ^a  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AMPLIFIERS, OPERATIONAL; COMPUTER SIMULATION; COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING; NEURAL NETWORKS;

SORTING NEURAL NETWORKS; SUPER-PARALLEL SORTING ALGORITHM;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0025521939     PISSN: 00984094     EISSN: None     Source Type: Journal    
DOI: 10.1109/31.62417     Document Type: Article

References (5)

1. K. E. Batcher, “Sorting networks and their applications,” in Proc. of the Spring Joint Computer Conf., vol. 32, AFIPS Press, 1968.
2. F. T. Leighton, “Tight bounds on the complexity of parallel sorting,” in Proc. of the ACM Symp. on Theory of Computing, pp. 71–80, 1984.
3. N. Alon and Y. Azar, “The average complexity of deterministic and randomized parallel comparison-sorting algorithms,” SIAM J. Computing, vol. 17, Dec. 1988.
4. Y. Takefuji and K. C. Lee, “A near-optimum parallel planarization algorithm,” Science, 245, pp. 1221–1223, Sept. 1989.
5. —, “A parallel algorithm for tiling problems,” IEEE Trans. Neural Networks, vol. 1, pp. 143–145, Mar. 1990.