Communications of the ACM
How to construct random functions
Journal of the ACM (JACM)
A simple unpredictable pseudo random number generator
SIAM Journal on Computing
Log depth circuits for division and related problems
SIAM Journal on Computing
Learning regular sets from queries and counterexamples
Information and Computation
RSA and Rabin functions: certain parts are as hard as the whole
SIAM Journal on Computing - Special issue on cryptography
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
When won't membership queries help?
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Improved learning of AC0 functions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
An O(nlog log n) learning algorithm for DNF under the uniform distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Being taught can be faster than asking questions
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Evaluation may be easier than generation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Computational sample complexity
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
Theoretical Computer Science - Algorithmic learning theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the Learnability of Hidden Markov Models
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
On Pseudorandom Generators in NC
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Cryptographic Primitives Based on Hard Learning Problems
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
On the difficulty of approximately maximizing agreements
Journal of Computer and System Sciences
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
Learning intersections and thresholds of halfspaces
Journal of Computer and System Sciences - Special issue on FOCS 2002
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Non-automatizability of bounded-depth frege proofs
Computational Complexity
Learning a circuit by injecting values
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Separating Models of Learning from Correlated and Uncorrelated Data
The Journal of Machine Learning Research
The complexity of properly learning simple concept classes
Journal of Computer and System Sciences
Optimally Learning Social Networks with Activations and Suppressions
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Learning a circuit by injecting values
Journal of Computer and System Sciences
Efficient learning algorithms yield circuit lower bounds
Journal of Computer and System Sciences
Cryptographic hardness for learning intersections of halfspaces
Journal of Computer and System Sciences
Smooth entropy and Rényi entropy
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Learning large-alphabet and analog circuits with value injection queries
COLT'07 Proceedings of the 20th annual conference on Learning theory
Optimally learning social networks with activations and suppressions
Theoretical Computer Science
SIAM Journal on Computing
Semantic communication for simple goals is equivalent to on-line learning
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Cryptography in constant parallel time
Cryptography in constant parallel time
Efficient learning algorithms yield circuit lower bounds
COLT'06 Proceedings of the 19th annual conference on Learning Theory
On PAC learning algorithms for rich boolean function classes
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Separating models of learning from correlated and uncorrelated data
COLT'05 Proceedings of the 18th annual conference on Learning Theory
| Hi-index | 0.00 |