A time-space tradeoff for element distinctness

Nondeterministic linear tasks may require substantially nonlinear deterministic time in the case of sublinear work space

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing

A general sequential time-space tradeoff for finding unique elements

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing

Tradeoffs between communication and space

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing

A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Determinism versus non-determinism for linear time RAMs (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Optimal time-space trade-offs for non-comparison-based sorting

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

Time-space trade-off lower bounds for randomized computation of decision problems

Journal of the ACM (JACM)

Determinism versus nondeterminism for linear time RAMs with memory restrictions

Journal of Computer and System Sciences - STOC 1999

I/O-Space Trade-Offs

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory

Quantum time-space tradeoffs for sorting

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Comparison-based time-space lower bounds for selection

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Comparison-based time-space lower bounds for selection

ACM Transactions on Algorithms (TALG)