Multiparty protocols and logspace-hard pseudorandom sequences
STOC '89 Proceedings of the twenty-first 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
Machine models and linear time complexity
ACM SIGACT News
Determinism versus non-determinism for linear time RAMs (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Lower bounds on the complexity of recognizing SAT by turing machines
Information Processing Letters
Determinism versus nondeterminism for linear time RAMs with memory restrictions
Journal of Computer and System Sciences - STOC 1999
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Multi-party finite computations
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Element distinctness and sorting on one-tape off-line turing machines
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
| Hi-index | 5.23 |