Information transfer and area-time tradeoffs for VLSI multiplication

DOI10.1145/358808.358814zbMath0423.68009OpenAlexW2080085596MaRDI QIDQ3857703

Peter Andreae, Harold Abelson

Publication date: 1980

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/358808.358814

zbMATH Keywords

analysis of algorithmsinteger multiplicationvery large-scale integrationarea-time tradeoffs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Circuits, networks (94C99)

Related Items

On problem transformability in VLSI ⋮ A VLSI fast solver for tridiagonal linear systems ⋮ Tight chip area lower bounds for string matching ⋮ The area-time complexity of the greatest common divisor problem: A lower bound ⋮ Semelectivity is not sufficient ⋮ ``Global graph problems tend to be intractable ⋮ Where-oblivious is not sufficient ⋮ Area-period tradeoffs for multiplication of rectangular matrices ⋮ The performance of multilective VLSI algorithms