The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
Journal of the ACM (JACM)
How to construct random functions
Journal of the ACM (JACM)
On hiding information form an oracle
Journal of Computer and System Sciences
On the complexity of partial order productions
SIAM Journal on Computing
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Hiding instances in multioracle queries
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Rigorous time/space tradeoffs for inverting functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Trade-offs between communication throughput and parallel time
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Witness-based cryptographic program checking and robust function sharing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Software reliability via run-time result-checking
Journal of the ACM (JACM)
Theoretical Computer Science - Algorithmic learning theory
Certification of Computational Results
IEEE Transactions on Computers
Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Sharing one secret vs. sharing many secrets
Theoretical Computer Science - Mathematical foundations of computer science
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences
Cell probe lower bounds for succinct data structures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Time space tradeoffs for attacks against one-way functions and PRGs
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Mitosis in computational complexity
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Separating the notions of self- and autoreducibility
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Autoreducibility, mitoticity, and immunity
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Rigorous bounds on cryptanalytic time/memory tradeoffs
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
| Hi-index | 0.00 |