A general class of resource tradeoffs

DOI10.1016/0022-0000(82)90005-8MaRDI QIDQ1837531zbMATH OpenOpenAlexFDO

Authors Jon Bentley, Donna J. Brown

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

binomial treeslinear recursion schematamultiway treeparallel sorting algorithmssearching algorithmsupper boundsVLSI layouts

Mathematics Subject Classification ID

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

Cites work

• A data structure for manipulating priority queues
• A Time-Space Trade-Off
• A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
• An almost optimal algorithm for unbounded searching
• An improved simulation result for ink-bounded Turing machines
• Decomposable searching problems I. Static-to-dynamic transformation
• Efficient generation of the binary reflected gray code and its applications
• Fast parallel sorting algorithms
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3640889 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Jump searching
• New Parallel-Sorting Schemes
• Optimal algorithms for sensitivity analysis in associative multiplication problems
• Space-time trade-offs on the FFT algorithm

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837531)