A time-space tradeoff for sorting on non-oblivious machines
From MaRDI portal
Publication:1152950
DOI10.1016/0022-0000(81)90037-4zbMath0462.68011MaRDI QIDQ1152950
Allan Borodin, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa, Michael J. Fischer
Publication date: 1981
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(81)90037-4
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68W99: Algorithms in computer science
Related Items
Time-space tradeoffs for algebraic problems on general sequential machines, Trade-offs between communication and space, The computational complexity of universal hashing, Time-space tradeoffs for set operations, Time-space tradeoffs in algebraic complexity theory