Where-oblivious is not sufficient

DOI10.1016/0020-0190(83)90111-4zbMath0528.68029OpenAlexW2070055612MaRDI QIDQ786531

Reiner Kolla

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90111-4

zbMATH Keywords

lower boundscrossing sequencesI/O scheduleVLSI models

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (2)

A minimum-area circuit for \(\ell\)-selection ⋮ Semelectivity is not sufficient

Cites Work

• Information transfer and area-time tradeoffs for VLSI multiplication
• The Area-Time Complexity of Binary Multiplication

This page was built for publication: Where-oblivious is not sufficient