A Time-Space Trade-Off

DOI10.1145/322077.322091MaRDI QIDQ4158451zbMATH OpenOpenAlexFDO

Authors Nicholas Pippenger

Publication date 1978

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322077.322091

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(12)

• A time-space tradeoff for sorting on non-oblivious machines
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• A note on the pebble game
• A space bound for one-tape multidimensional Turing machines
• Time-space tradeoffs for computing functions, using connectivity properties of their circuits
• Time-space trade-offs in a pebble game
• Enumerating the cycles of a digraph: a new preprocessing strategy
• Time-space tradeoffs for algebraic problems on general sequential machines
• A general class of resource tradeoffs
• On Reducing the Space Requirements of a Straight-Line Algorithm
• Space-time tradeoffs for linear recursion
• Time-space tradeoffs in algebraic complexity theory

This page was built for publication: A Time-Space Trade-Off

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