A model of computation for VLSI with related complexity results
From MaRDI portal
Publication:3766855
DOI10.1145/3828.3834zbMath0629.68053OpenAlexW1999211268WikidataQ128011624 ScholiaQ128011624MaRDI QIDQ3766855
Louis Monier, Bernard Chazelle
Publication date: 1985
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3828.3834
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
The applicability of discrete performance estimation methods to VLSI design ⋮ A minimum-area circuit for \(\ell\)-selection ⋮ Optimal tradeoffs for addition on systolic arrays ⋮ The communication complexity of several problems in matrix computation ⋮ Computing with pipelined block transfer ⋮ New lower bound techniques for VLSI ⋮ Lower bounds and hardness magnification for sublinear-time shrinking cellular automata
This page was built for publication: A model of computation for VLSI with related complexity results
