A time-space tradeoff for element distinctness
SIAM Journal on Computing
Two time-space tradeoffs for element distinctness
Theoretical Computer Science
A general sequential time-space tradeoff for finding unique elements
SIAM Journal on Computing
Time-Space Tradeoffs for Branching Programs
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Optimal Time-Space Trade-Offs for Sorting
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
A note on the decoding complexity of error-correcting codes
Information Processing Letters
A nondeterministic space-time tradeoff for linear codes
Information Processing Letters
Comparison-based time-space lower bounds for selection
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The minimum distance of turbo-like codes
IEEE Transactions on Information Theory
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
Determinism versus nondeterminism with arithmetic tests and computation: extended abstract
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Lower bounds for RAMs and quantifier elimination
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.06 |
Our computational model is a random access machine with n read only input registers each containing c log n bits of information and a read and write memory. We measure the time by the number of accesses to the input registers. We show that for all k there is an ε 0 so that if n is sufficiently large then the elements distinctness problem cannot be solved in time kn with εn bits of read and write memory; that is, there is no machine with this value of the parameters which decides whether there are two different input registers whose contents are identical.