On the random oracle hypothesis
Information and Control
Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
On one-way functions and polynomial-time isomorphisms
Theoretical Computer Science
Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
One-way functions and the nonisomorphism of NP-complete sets
Theoretical Computer Science
On the p-isomorphism conjecture
Theoretical Computer Science
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Relativized Questions Involving Probabilistic Algorithms
Journal of the ACM (JACM)
A relativized failure of the Berman-Hartmanis conjecture
A relativized failure of the Berman-Hartmanis conjecture
Polynomial reducibilities and complete sets.
Polynomial reducibilities and complete sets.
The cpa's responsibility for the prevention and detection of computer fraud.
The cpa's responsibility for the prevention and detection of computer fraud.
Reducing the complexity of reductions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Information and Computation
Separability and one-way functions
Computational Complexity
The isomorphism conjecture for constant depth reductions
Journal of Computer and System Sciences
| Hi-index | 0.00 |