A VLSI partition algorithm

DOI10.1007/BF01934087MaRDI QIDQ1104757zbMATH OpenOpenAlexFDO

Authors Shou-Hsuan S. Huang

Publication date 1988

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01934087

zbMATH Keywords

partitionquicksortsortingVLSI algorithmVLSI sorter

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• VLSI Sorting with Reduced Hardware
• A Minimum Area VLSI Network for O(log n) Time Sorting
• Optimal VLSI circuits for sorting
• Systolic Sorting on a Mesh-Connected Network
• VLSI-sorting evaluated under the linear model

Cites work

• A characterization of normal operators
• scientific article; zbMATH DE number 3628373 (Why is no real title available?)
• scientific article; zbMATH DE number 3800919 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Quicksort
• Sorting on a mesh-connected parallel computer

Cited in

(1)

• Partitioning a set of vectors with integer coordinates by means of logical hardware

Describes a project that uses

Uses Software

• Quicksort

This page was built for publication: A VLSI partition algorithm

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