Fault-tolerance VLSI sorters

DOI10.1007/BF01598957zbMATH Open0653.68049MaRDI QIDQ1108014FDOQ1108014

Authors I. V. Ramakrishnan, Peter J. Varman, Donald S. Fussell 

Publication date 1987

Published in Circuits, Systems, and Signal Processing (Search for Journal in Brave)

zbMATH Keywords

parallel algorithms

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3628373 (Why is no real title available?)
• Configuration of VLSI Arrays in the Presence of Defects
• Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
• Parallel Processing with the Perfect Shuffle
• The VLSI Complexity of Sorting
• Wafer-Scale Integration of Systolic Arrays

This page was built for publication: Fault-tolerance VLSI sorters

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