Communications of the ACM
Learning regular sets from queries and counterexamples
Information and Computation
Learning decision trees from random examples needed for learning
Information and Computation
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A Spectral Lower Bound Technique for the Size of Decision Trees and Two-Level AND/OR Circuits
IEEE Transactions on Computers
A guided tour of Chernoff bounds
Information Processing Letters
Identifying μ-formula decision trees with queries
COLT '90 Proceedings of the third annual workshop on Computational learning theory
Learning the Fourier spectrum of probabilistic lists and trees
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
THE SPECTRAL NORM OF FINITE FUNCTIONS
THE SPECTRAL NORM OF FINITE FUNCTIONS
Computational learning theory: survey and selected bibliography
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the degree of Boolean functions as real polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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
A technique for upper bounding the spectral norm with applications to learning
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Exact learning of read-k disjoint DNF and not-so-disjoint DNF
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Learning sparse multivariate polynomials over a field with queries and counterexamples
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Learning k&mgr; decision trees on the uniform distribution
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Oracles and queries that are sufficient for exact learning (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Pseudorandom generators and learning algorithms for AC
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the Fourier spectrum of monotone functions
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Learning using group representations (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
On the boosting ability of top-down decision tree learning algorithms
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
MobiMine: monitoring the stock market from a PDA
ACM SIGKDD Explorations Newsletter
Near-optimal sparse fourier representations via sampling
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Toward Machine Learning Through Genetic Code-like Transformations
Genetic Programming and Evolvable Machines
The Genetic Code-Like Transformations and Their Effect on Learning Functions
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
On Using Extended Statistical Queries to Avoid Membership Queries
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries
Annals of Mathematics and Artificial Intelligence
Gene expression and scalable genetic search
Advances in evolutionary computing
On using extended statistical queries to avoid membership queries
The Journal of Machine Learning Research
The monotone theory for the PAC-model
Information and Computation
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Separating Models of Learning with Faulty Teachers
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
An efficient cryptosystem Delta for stream cipher applications
Computers and Electrical Engineering
Private multiparty sampling and approximation of vector combinations
Theoretical Computer Science
The Security of All Bits Using List Decoding
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
On the parity complexity measures of Boolean functions
Theoretical Computer Science
Fast private norm estimation and heavy hitters
TCC'08 Proceedings of the 5th conference on Theory of cryptography
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Simple and practical algorithm for sparse Fourier transform
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved lower bounds for learning intersections of halfspaces
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Nearly optimal sparse fourier transform
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Private multiparty sampling and approximation of vector combinations
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform
Proceedings of the 32nd symposium on Principles of database systems
Testing linear-invariant function isomorphism
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Theoretical Computer Science
| Hi-index | 0.00 |