The area-time complexity of the VLSI counter

DOI10.1016/0020-0190(87)90218-3zbMath0633.68024OpenAlexW1969198249MaRDI QIDQ1096385

Imrich Vrt'o

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90218-3

zbMATH Keywords

lower boundarea-time complexityVLSI modelcounter

Mathematics Subject Classification ID

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

Cites Work

• Area-time lower-bound techniques with applications to sorting

This page was built for publication: The area-time complexity of the VLSI counter