scientific article; zbMATH DE number 3911723

From MaRDI portal
Publication:3687730





[For the entire collection see Zbl 0563.00018.] Recently discovered lower bounds for the area-time complexity of VLSI sorting of n k-bit keys exhibit a dependence upon the key length. On this basis, keys can be classified into short (k\(\leq \log n)\), long (k\(\geq \log n)\) and intermediate-length. Intermediate-length keys have been heretofore the object of investigation; this paper investigates the other two cases and confirms the inherent validity of the bounds for short and long keys by exhibiting optimal or near-optimal VLSI networks.











This page was built for publication:

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