Tight chip area lower bounds for string matching

DOI10.1016/0020-0190(87)90048-2zbMath0654.68039OpenAlexW2010956365MaRDI QIDQ1108789

Ondrej Sýkora, 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)90048-2

zbMATH Keywords

Boolean functionslower boundsstring matchingchip areaVLSI circuit

Mathematics Subject Classification ID

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

Related Items

Lower bounds on the area of finite-state machines

Cites Work

• Unnamed Item
• Information transfer and area-time tradeoffs for VLSI multiplication