The area-time complexity of the VLSI counter

DOI10.1016/0020-0190(87)90218-3MaRDI QIDQ1096385zbMATH OpenOpenAlexFDO

Authors 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

area-time complexitycounterlower boundVLSI model

Mathematics Subject Classification ID

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

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

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