A general class of resource tradeoffs
type: Item
instance of: scholarly article
title: A general class of resource tradeoffs
zbMATH Open document ID: 0507.68019
DOI: 10.1016/0022-0000(82)90005-8
author: Jon Bentley
author: Donna J. Brown
published in: Journal of Computer and System Sciences
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3800920
zbMATH Keywords: parallel sorting algorithms
zbMATH Keywords: linear recursion schemata
zbMATH Keywords: VLSI layouts
zbMATH Keywords: searching algorithms
zbMATH Keywords: multiway tree
zbMATH Keywords: binomial trees
zbMATH Keywords: upper bounds
MaRDI profile type: Publication
full work available at URL: 0022-0000(82)90005-8
OpenAlex ID: W2035367168
cites work: Decomposable searching problems I. Static-to-dynamic transformation
cites work: An almost optimal algorithm for unbounded searching
cites work: Efficient generation of the binary reflected gray code and its applications
cites work: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
cites work: Fast parallel sorting algorithms
cites work: Q4199542
cites work: Q5585020
cites work: Q4057549
cites work: An improved simulation result for ink-bounded Turing machines
cites work: A Time-Space Trade-Off
cites work: New Parallel-Sorting Schemes
cites work: Optimal algorithms for sensitivity analysis in associative multiplication problems
cites work: Space-time trade-offs on the FFT algorithm
cites work: Jump searching
cites work: A data structure for manipulating priority queues
description: scientific article; zbMATH DE number 3800920