A neural sorting network with O(1) time complexity

DOI10.1016/0020-0190(93)90042-8zbMath0776.68048OpenAlexW2040940142MaRDI QIDQ2365819

Wen-Tsuen Chen, Kuen-Rong Hsieh

Publication date: 29 June 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90042-8

zbMATH Keywords

sortingneural network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items (1)

A note on neural sorting networks with O(1) time complexity

Cites Work

• Constant time sorting on a processor array with a reconfigurable bus system
• ``Neural computation of decisions in optimization problems
• The complexity of analog computation
• Parallel complexity of sorting problems
• Sorting on a mesh-connected parallel computer
• The Indirect Binary n-Cube Microprocessor Array
• Sorting on STAR
• Parallel Processing with the Perfect Shuffle
• Unnamed Item

This page was built for publication: A neural sorting network with O(1) time complexity