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
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
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
Tighter bounds for nearest neighbor search and related problems in the cell probe model
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The invasiveness of off-line memory checking
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth 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
Compactly encoding unstructured inputs with differential compression
Journal of the ACM (JACM)
On the nonapproximability of boolean Function by OBDDs and read-k-times Branching Programs
Information and Computation
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
Journal of Computer and System Sciences - Special issue on STOC 2000
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
Theoretical Computer Science
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
| Hi-index | 0.00 |