VLSI-sorting evaluated under the linear model

DOI10.1016/0885-064X(88)90014-3zbMath0667.68076MaRDI QIDQ1117701

S. H. Smith

Publication date: 1988

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

linear modelasymptotic analysisparallel algorithmcomputation complexityVLSI-sorting

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The VLSI Complexity of Sorting
• Parallel Sorting with Serial Memories
• An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
• Systolic Sorting on a Mesh-Connected Network
• A note on dpda transductions of {0,1}^∗and inverse dpda transductions of the dyck set
• Sorting on a mesh-connected parallel computer
• Algorithm and Hardware for a Merge Sort Using Multiple Processors
• Bitonic Sort on a Mesh-Connected Parallel Computer

This page was built for publication: VLSI-sorting evaluated under the linear model