A general class of resource tradeoffs

DOI10.1016/0022-0000(82)90005-8zbMath0507.68019OpenAlexW2035367168MaRDI QIDQ1837531

Donna J. Brown, Jon Louis Bentley

Publication date: 1982

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(82)90005-8

zbMATH Keywords

upper boundssearching algorithmsbinomial treesmultiway treeparallel sorting algorithmsVLSI layoutslinear recursion schemata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Algorithms in computer science (68W99)

Related Items (4)

Binary search with errors and variable cost queries ⋮ On time versus space III ⋮ On the factorization conjecture ⋮ Trade-offs between communication and space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal algorithms for sensitivity analysis in associative multiplication problems
• An improved simulation result for ink-bounded Turing machines
• An almost optimal algorithm for unbounded searching
• Decomposable searching problems I. Static-to-dynamic transformation
• A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
• Efficient generation of the binary reflected gray code and its applications
• A data structure for manipulating priority queues
• Space-time trade-offs on the FFT algorithm
• A Time-Space Trade-Off
• New Parallel-Sorting Schemes
• Fast parallel sorting algorithms
• Jump searching

This page was built for publication: A general class of resource tradeoffs