Dana Angluin
Dana Angluin
Professor of Computer Science, Yale University
Verified email at cs.yale.edu
TitleCited byYear
Queries and concept learning
D Angluin
Machine learning 2 (4), 319-342, 1988
23621988
Learning regular sets from queries and counterexamples
D Angluin
Information and computation 75 (2), 87-106, 1987
22121987
Inductive inference: Theory and methods
D Angluin, CH Smith
ACM Computing Surveys (CSUR) 15 (3), 237-269, 1983
12681983
Inductive inference of formal languages from positive data
D Angluin
Information and control 45 (2), 117-135, 1980
10331980
Fast probabilistic algorithms for Hamiltonian circuits and matchings
D Angluin, LG Valiant
Journal of Computer and system Sciences 18 (2), 155-193, 1979
8501979
Learning from noisy examples
D Angluin, P Laird
Machine Learning 2 (4), 343-370, 1988
8451988
Finding patterns common to a set of strings
D Angluin
Proceedings of the eleventh annual ACM symposium on Theory of computing, 130-141, 1979
7991979
Local and global properties in networks of processors
D Angluin
Proceedings of the twelfth annual ACM symposium on Theory of computing, 82-93, 1980
7611980
Inference of reversible languages
D Angluin
Journal of the ACM (JACM) 29 (3), 741-765, 1982
6891982
Computation in networks of passively mobile finite-state sensors
D Angluin, J Aspnes, Z Diamadi, MJ Fischer, R Peralta
Distributed computing 18 (4), 235-253, 2006
5352006
Negative results for equivalence queries
D Angluin
Machine Learning 5 (2), 121-150, 1990
3141990
When won't membership queries help?
D Angluin, M Kharitonov
Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991
3061991
On the complexity of minimum inference of regular sets
D Angluin
Information and control 39 (3), 337-350, 1978
2951978
The computational power of population protocols
D Angluin, J Aspnes, D Eisenstat, E Ruppert
Distributed Computing 20 (4), 279-304, 2007
2622007
Two notions of correctness and their relation to testing
TA Budd, D Angluin
Acta informatica 18 (1), 31-45, 1982
2561982
Computational learning theory: survey and selected bibliography
D Angluin
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992
2521992
Queries revisited
D Angluin
Theoretical Computer Science 313 (2), 175-194, 2004
2492004
Learning conjunctions of Horn clauses
D Angluin, M Frazier, L Pitt
Machine Learning 9 (2-3), 147-164, 1992
2381992
Learning read-once formulas with queries
D Angluin, L Hellerstein, M Karpinski
Journal of the ACM (JACM) 40 (1), 185-210, 1993
2311993
A note on the number of queries needed to identify regular languages
D Angluin
Information and control 51 (1), 76-87, 1981
2231981
The system can't perform the operation now. Try again later.
Articles 1–20