Follow
Dana Angluin
Dana Angluin
Professor of Computer Science, Yale University
Verified email at cs.yale.edu
Title
Cited by
Cited by
Year
Queries and concept learning
D Angluin
Machine learning 2, 319-342, 1988
29561988
Learning regular sets from queries and counterexamples
D Angluin
Information and computation 75 (2), 87-106, 1987
29201987
Inductive inference: Theory and methods
D Angluin, CH Smith
ACM computing surveys (CSUR) 15 (3), 237-269, 1983
14121983
Learning from noisy examples
D Angluin, P Laird
Machine learning 2, 343-370, 1988
12571988
Inductive inference of formal languages from positive data
D Angluin
Information and control 45 (2), 117-135, 1980
11441980
Fast probabilistic algorithms for Hamiltonian circuits and matchings
D Angluin, LG Valiant
Proceedings of the ninth annual ACM symposium on Theory of computing, 30-41, 1977
9491977
Local and global properties in networks of processors
D Angluin
Proceedings of the twelfth annual ACM symposium on Theory of computing, 82-93, 1980
9221980
Finding patterns common to a set of strings
D Angluin
Proceedings of the eleventh annual ACM Symposium on Theory of Computing, 130-141, 1979
8831979
Computation in networks of passively mobile finite-state sensors
D Angluin, J Aspnes, Z Diamadi, MJ Fischer, R Peralta
Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004
7662004
Inference of reversible languages
D Angluin
Journal of the ACM (JACM) 29 (3), 741-765, 1982
7591982
Negative results for equivalence queries
D Angluin
Machine Learning 5, 121-150, 1990
3721990
The computational power of population protocols
D Angluin, J Aspnes, D Eisenstat, E Ruppert
Distributed Computing 20, 279-304, 2007
3662007
When won't membership queries help?
D Angluin, M Kharitonov
Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991
3571991
On the complexity of minimum inference of regular sets
D Angluin
Information and control 39 (3), 337-350, 1978
3521978
Two notions of correctness and their relation to testing
TA Budd, D Angluin
Acta informatica 18, 31-45, 1982
3431982
Queries revisited
D Angluin
Theoretical Computer Science 313 (2), 175-194, 2004
3212004
Computational learning theory: survey and selected bibliography
D Angluin
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992
3031992
Fast computation by population protocols with a leader
D Angluin, J Aspnes, D Eisenstat
Distributed Computing 21, 183-199, 2008
2792008
Learning conjunctions of Horn clauses
D Angluin, M Frazier, L Pitt
Machine Learning 9, 147-164, 1992
2711992
A simple population protocol for fast robust approximate majority
D Angluin, J Aspnes, D Eisenstat
Distributed Computing 21, 87-102, 2008
2532008
The system can't perform the operation now. Try again later.
Articles 1–20