Minimum Storage Sorting Networks

DOI10.1109/TC.1985.5009386MaRDI QIDQ3219777zbMATH OpenFDO

Authors Alan Siegel

Publication date 1985

Published in IEEE Transactions on Computers (Search for Journal in Brave)

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

zbMATH Keywords

data compressionsortingVLSILower boundsminimum storage networkminimum storage requirements

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25)

Recommendations

• scientific article; zbMATH DE number 3940717
• Tight Bounds on the Complexity of Parallel Sorting
• A Minimum Area VLSI Network for O(log n) Time Sorting
• Area-time lower-bound techniques with applications to sorting
• Optimal VLSI circuits for sorting

Cited in

(10)

• Bitonic sorters of minimal depth
• scientific article; zbMATH DE number 3940717 (Why is no real title available?)
• An Architecture for Bitonic Sorting with Optimal VLSI Performnance
• Semelectivity is not sufficient
• A minimum-area circuit for -selection
• On problem transformability in VLSI
• Toward a lower bound for sorting networks
• scientific article; zbMATH DE number 3911723 (Why is no real title available?)
• Area efficient layouts of the Batcher sorting networks
• Area complexity of merging

This page was built for publication: Minimum Storage Sorting Networks

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