Communications of the ACM
The complexity of Boolean functions
The complexity of Boolean functions
An algorithm for finding Hamilton paths and cycles in random graphs
Combinatorica - 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
A guided tour of Chernoff bounds
Information Processing Letters
A general lower bound on the number of examples needed for learning
COLT '88 Proceedings of the first annual workshop on Computational learning theory
Learning monotone ku DNF formulas on product distributions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Improved learning of AC0 functions
COLT '91 Proceedings of the fourth 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
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
Polynomial threshold functions, AC0 functions, and spectral norms
SIAM Journal on Computing
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
Efficient noise-tolerant learning from statistical queries
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
Learning monotone log-term DNF formulas
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
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
Randomized Interpolation and Approximationof Sparse Polynomials
SIAM Journal on Computing
Simple learning algorithms using divide and conquer
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Computational Complexity of Machine Learning
Computational Complexity of Machine Learning
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Hardness amplification within NP
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Discrete Mathematics - Kleitman and combinatorics: a celebration
On Learning Monotone DNF under Product Distributions
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
On Learning Monotone Boolean Functions under the Uniform Distribution
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries
Annals of Mathematics and Artificial Intelligence
On the noise sensitivity of monotone functions
Random Structures & Algorithms
Learning intersections and thresholds of halfspaces
Journal of Computer and System Sciences - Special issue on FOCS 2002
Hardness amplification within NP
Journal of Computer and System Sciences - Special issue on computational complexity 2002
On learning monotone DNF under product distributions
Information and Computation
Agnostically Learning Halfspaces
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Learning DNF from random walks
Journal of Computer and System Sciences - Special issue: Learning theory 2003
On learning monotone boolean functions under the uniform distribution
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Separating Models of Learning from Correlated and Uncorrelated Data
The Journal of Machine Learning Research
Unconditional lower bounds for learning intersections of halfspaces
Machine Learning
The decomposition tree for analyses of boolean functions
Mathematical Structures in Computer Science
Optimal query complexity bounds for finding graphs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Parameterized Learnability of k-Juntas and Related Problems
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Approximate lineage for probabilistic databases
Proceedings of the VLDB Endowment
Parameterized learnability of juntas
Theoretical Computer Science
Application of a generalization of russo's formula to learning from multiple random oracles
Combinatorics, Probability and Computing
A lower bound for agnostically learning disjunctions
COLT'07 Proceedings of the 20th annual conference on Learning theory
Optimal query complexity bounds for finding graphs
Artificial Intelligence
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing
Learning and lower bounds for AC0 with threshold gates
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Discrete Applied Mathematics
Proceedings of the forty-third annual ACM symposium on Theory of computing
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
Journal of Computer and System Sciences
Approximating the influence of monotone boolean functions in O(√n) query complexity
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
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
On derandomization and average-case complexity of monotone functions
Theoretical Computer Science
A complete characterization of statistical query learning with applications to evolvability
Journal of Computer and System Sciences
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity
ACM Transactions on Computation Theory (TOCT)
Approximation by DNF: examples and counterexamples
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Improved Approximation of Linear Threshold Functions
Computational Complexity
Inferring Boolean functions via higher-order correlations
Computational Statistics
| Hi-index | 0.01 |