Area complexity of merging

DOI10.1016/0304-3975(91)90179-6zbMATH Open0729.68031OpenAlexW1978069041WikidataQ110864316 ScholiaQ110864316MaRDI QIDQ807018FDOQ807018

Ondrej Sýkora, Imrich Vrt'o, Vladimír Palko

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

Recommendations

• scientific article
• Lower bounds for merging networks
• scientific article; zbMATH DE number 3894473
• scientific article; zbMATH DE number 1256659
• scientific article; zbMATH DE number 3915623

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

• Minimum Storage Sorting Networks
• Title not available (Why is that?)
• Area-time lower-bound techniques with applications to sorting
• A minimum-area circuit for \(\ell\)-selection
• Title not available (Why is that?)
• The Area-Time Complexity of Binary Multiplication
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Area complexity of merging

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