Journal of the ACM (JACM)
Sparse sets and collapse of complexity classes
Information and Computation
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Restrictive Acceptance Suffices for Equivalence Problems
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Tight lower bounds on the ambiguity of strong, total, associative, one-way functions
Journal of Computer and System Sciences
Lower bounds and the hardness of counting properties
Theoretical Computer Science
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
NL-printable sets and nondeterministic Kolmogorov complexity
Theoretical Computer Science - Logic, language, information and computation
If P ≠ NP then some strongly noninvertible functions are invertible
Theoretical Computer Science
Quantum cryptography: A survey
ACM Computing Surveys (CSUR)
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
Distributionally-hard languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Characterizations and Existence of Easy Sets without Hard Subsets
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
| Hi-index | 0.00 |