Communications of the ACM
Primality and cryptography
How to construct random functions
Journal of the ACM (JACM)
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Log depth circuits for division and related problems
SIAM Journal on Computing
One-way functions and pseudorandom generators
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On the learnability of Boolean formulae
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Information Processing Letters
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
Computational limitations on learning from examples
Journal of the ACM (JACM)
The minimum consistent DFA problem cannot be approximated within and polynomial
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An O(n0.4)-approximation algorithm for 3-coloring
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
COLT '88 Proceedings of the first annual workshop on Computational learning theory
Training a 3-node neural network is NP-complete
COLT '88 Proceedings of the first annual workshop on Computational learning theory
Equivalence of models for polynomial learnability
COLT '88 Proceedings of the first annual workshop on Computational learning theory
Learnability by fixed distributions
COLT '88 Proceedings of the first annual workshop on Computational learning theory
A general lower bound on the number of examples needed for learning
COLT '88 Proceedings of the first annual workshop on Computational learning theory
On the learnability of finite automata
COLT '88 Proceedings of the first annual workshop on Computational learning theory
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A new approximate graph coloring algorithm
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Inference of finite automata using homing sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The minimum consistent DFA problem cannot be approximated within and polynomial
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
On the necessity of Occam algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
When won't membership queries help?
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Learning the Fourier spectrum of probabilistic lists and trees
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Computational learning theory: survey and selected bibliography
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Random DFA's can be approximately learned from sparse uniform examples
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Learning DNF formulae under classes of probability distributions
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Learnability of description logics
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Toward efficient agnostic learning
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
An improved boosting algorithm and its implications on learning complexity
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Robust trainability of single neurons
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM (JACM)
Learning read-once formulas with queries
Journal of the ACM (JACM)
Efficient learning of typical finite automata from random walks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bounds for the computational power and learning complexity of analog neural nets
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Cryptographic hardness of distribution-specific learning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Learning fallible finite state automata
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Amplification of weak learning under the uniform distribution
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Conservativeness and monotonicity for learning algorithms
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
Bayesian inductive logic programming
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning from a consistently ignorant teacher
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Efficient distribution-free learning of probabilistic concepts
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
On the learnability of discrete distributions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
On the Fourier spectrum of monotone functions
STOC '95 Proceedings of the twenty-seventh 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
On learning bounded-width branching programs
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
On learning width two branching programs (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Learning with maximum-entropy distributions
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Hardness Results for Learning First-Order Representations and Programming by Demonstration
Machine Learning - Special issue on the ninth annual conference on computational theory (COLT '96)
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Learning with Maximum-Entropy Distributions
Machine Learning
Simple, state-based approaches to program-based anomaly detection
ACM Transactions on Information and System Security (TISSEC)
Learning DFA from Simple Examples
Machine Learning
Hardness results for neural network approximation problems
Theoretical Computer Science
Computational complexity of neural networks: a survey
Nordic Journal of Computing
ECML '02 Proceedings of the 13th European Conference on Machine Learning
On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
A Real-Time Intrusion Detection System Based on Learning Program Behavior
RAID '00 Proceedings of the Third International Workshop on Recent Advances in Intrusion Detection
Structural Complexity and Neural Networks
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
Hardness Results for Neural Network Approximation Problems
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Smooth Boosting and Learning with Malicious Noise
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Inferring Deterministic Linear Languages
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Cryptographic Primitives Based on Hard Learning Problems
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Some connections between learning and optimization
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Probabilistic Finite-State Machines-Part II
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Deterministic Finite Automata with a Smart State Labeling Evolutionary Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Probabilistic Finite-State Machines-Part I
IEEE Transactions on Pattern Analysis and Machine Intelligence
Partially distribution-free learning of regular languages from positive samples
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
A Real generalization of discrete AdaBoost
Artificial Intelligence
Boosting and other ensemble methods
Neural Computation
Application of automata learning algorithms to robot motion tracking
ISPRA'05 Proceedings of the 4th WSEAS International Conference on Signal Processing, Robotics and Automation
Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Intrinsic Geometries in Learning
Emerging Trends in Visual Computing
A Real generalization of discrete AdaBoost
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
On the prospects for building a working model of the visual cortex
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Pac-learning recursive logic programs: negative results
Journal of Artificial Intelligence Research
Real boosting a la carte with an application to boosting oblique decision trees
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Some connections between learning and optimization
Discrete Applied Mathematics
A bibliographical study of grammatical inference
Pattern Recognition
Probably approximately correct learning
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Cryptographic limitations on learning one-clause logic programs
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Algorithms and theory of computation handbook
Lower bounds on learning random structures with statistical queries
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Formal and empirical grammatical inference
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
Automatic citrus canker detection from leaf images captured in field
Pattern Recognition Letters
Languages as hyperplanes: grammatical inference with string kernels
ECML'06 Proceedings of the 17th European conference on Machine Learning
Learning stochastic logical automaton
JSAI'05 Proceedings of the 2005 international conference on New Frontiers in Artificial Intelligence
Securing netlist-level FPGA design through exploiting process variation and degradation
Proceedings of the ACM/SIGDA international symposium on Field Programmable Gate Arrays
Identification in the limit of systematic-noisy languages
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Global reweighting and weight vector based strategy for multiclass boosting
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part II
| Hi-index | 0.00 |