On the analysis of sorting networks from the viewpoint of circuit theory

DOI10.1109/81.668875MaRDI QIDQ4221015zbMATH OpenOpenAlexFDO

Authors Wenzhe Li, Ji-Nan Lin, Rolf Unbehauen

Publication date 18 May 1999

Published in IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/81.668875

zbMATH Keywords

sorting networkWDF networks

Mathematics Subject Classification ID

Searching and sorting (68P10) Analytic circuit theory (94C05)

Recommendations

• The periodic balanced sorting network
• Toward a lower bound for sorting networks
• On the complexity of min-max sorting networks
• Sorting networks: to the end and back again
• Sorting networks: the end game

Cited in

(5)

• A theoretical look at \textsc{Electre Tri}-nB and related sorting models
• The Complexity of Sorting with Networks of Stacks and Queues
• On the class of linear filters attainable with charge routing networks
• scientific article; zbMATH DE number 3409236 (Why is no real title available?)
• Constructing sorting networks from k-sorters

This page was built for publication: On the analysis of sorting networks from the viewpoint of circuit theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221015)