Area complexity of merging

DOI10.1016/0304-3975(91)90179-6zbMath0729.68031OpenAlexW1978069041WikidataQ110864316 ScholiaQ110864316MaRDI QIDQ807018

Vladimir Palko, Ondrej Sýkora, Imrich Vrt'o

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90179-6

zbMATH Keywords

merging two sorted arraysVLSI algorithmsVLSI area complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Area-time lower-bound techniques with applications to sorting
• A minimum-area circuit for \(\ell\)-selection
• Minimum Storage Sorting Networks
• The Area-Time Complexity of Binary Multiplication