Communications of the ACM
On the learnability of Boolean formulae
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Learning regular sets from queries and counterexamples
Information and Computation
Negative Results for Equivalence Queries
Machine Learning
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
Computational learning theory: survey and selected bibliography
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Machine Learning
Machine Learning
Fixed-Parameter Intractability II (Extended Abstract)
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Parameterized Learnability of k-Juntas and Related Problems
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Parameterized learnability of juntas
Theoretical Computer Science
Bounded fixed-parameter tractability and log2n nondeterministic bits
Journal of Computer and System Sciences
W[2]-hardness of precedence constrained K-processor scheduling
Operations Research Letters
Theoretical Computer Science
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |