Where-oblivious is not sufficient
type: Item
instance of: scholarly article
title: Where-oblivious is not sufficient
zbMATH Open document ID: 0528.68029
DOI: 10.1016/0020-0190(83)90111-4
author: Reiner Kolla
published in: Information Processing Letters
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W35
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 3839318
zbMATH Keywords: VLSI models
zbMATH Keywords: lower bounds
zbMATH Keywords: crossing sequences
zbMATH Keywords: I/O schedule
MaRDI profile type: Publication
full work available at URL: 0020-0190(83)90111-4
OpenAlex ID: W2070055612
cites work: Information transfer and area-time tradeoffs for VLSI multiplication
cites work: The Area-Time Complexity of Binary Multiplication
description: scientific article; zbMATH DE number 3839318