A minimum-area circuit for \(\ell\)-selection

DOI10.1007/BF01840362zbMath0627.68041OpenAlexW2011276193MaRDI QIDQ1092661

Pavol Ďuriš, Ondrej Sýkora, Clark D. Thompson, Imrich Vrt'o

Publication date: 1987

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01840362

zbMATH Keywords

lower boundsVLSI circuitsarea-time complexityVLSI algorithms\(\ell \)-selectionminimum-area computationselection of the \(\ell th\) smallest element

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Semelectivity is not sufficient ⋮ Area complexity of merging

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Where-oblivious is not sufficient
• Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations
• The VLSI Complexity of Sorting
• Minimum Storage Sorting Networks
• A model of computation for VLSI with related complexity results
• The Area-Time Complexity of Binary Multiplication

This page was built for publication: A minimum-area circuit for \(\ell\)-selection