☰

Dana Angluin - Publications

Affiliations: 
Computer Science Yale University, New Haven, CT 
Tree Info Similar researchers PubMed Report error

43 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Angluin D, Dohrn T. The power of random counterexamples Theoretical Computer Science. 808: 2-13. DOI: 10.1016/J.Tcs.2019.11.009  0.42
2017 Angluin D, Becerra-Bonache L. A model of language learning with semantics and meaning-preserving corrections Artificial Intelligence. 242: 23-51. DOI: 10.1016/J.Artint.2016.10.002  0.414
2015 Angluin D, Chen D. Learning a random DFA from uniform strings and state information Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9355: 119-133. DOI: 10.1007/978-3-319-24486-0_8  0.302
2015 Angluin D, Eisenstat S, Fisman D. Learning regular languages via alternating automata Ijcai International Joint Conference On Artificial Intelligence. 2015: 3308-3314.  0.38
2014 Angluin D, Fisman D. Learning regular omega languages Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8776: 125-139. DOI: 10.1016/J.Tcs.2016.07.031  0.488
2014 Angluin D, Aspnes J, Bazzi RA, Chen J, Eisenstat D, Konjevod G. Effective storage capacity of labeled graphs Information and Computation. 234: 44-56. DOI: 10.1016/J.Ic.2013.11.004  0.465
2013 Abouzied A, Angluin D, Papadimitriou C, Hellerstein JM, Silberschatz A. Learning and verifying quantified boolean queries by example Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 49-60. DOI: 10.1145/2463664.2465220  0.323
2013 Angluin D, Aspnes J, Reyzin L. Network construction with subgraph connectivity constraints Journal of Combinatorial Optimization. 29: 418-432. DOI: 10.1007/S10878-013-9603-2  0.634
2013 Angluin D, Aspnes J, Eisenstat S, Kontorovich A. On the learnability of shuffle ideals Journal of Machine Learning Research. 14: 1513-1531. DOI: 10.1007/978-3-642-34106-9_12  0.372
2010 Angluin D, Aspnes J, Reyzin L. Optimally learning social networks with activations and suppressions Theoretical Computer Science. 411: 2729-2740. DOI: 10.1016/J.Tcs.2010.04.008  0.675
2010 Angluin D, Eisenstat D, Kontorovich L, Reyzin L. Lower bounds on learning random structures with statistical queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6331: 194-208. DOI: 10.1007/978-3-642-16108-7_18  0.644
2010 Angluin D, Aspnes J, Reyzin L. Inferring social networks from outbreaks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6331: 104-118. DOI: 10.1007/978-3-642-16108-7_12  0.629
2009 Angluin D, Aspnes J, Chen J, Wu Y. Learning a circuit by injecting values Journal of Computer and System Sciences. 75: 60-77. DOI: 10.1016/J.Jcss.2008.07.004  0.551
2009 Angluin D, Becerra-Bonache L, Dediu AH, Reyzin L. Learning finite automata using label queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5809: 171-185. DOI: 10.1007/978-3-642-04414-4_17  0.639
2009 Angluin D, Aspnes J, Chen J, Eisenstat D, Reyzin L. Learning acyclic probabilistic circuits using test paths Journal of Machine Learning Research. 10: 1881-1911.  0.654
2009 Angluin D, Aspnes J, Chen J, Eisenstat D, Reyzin L. Learning acyclic probabilistic circuits using test paths Journal of Machine Learning Research. 10: 1881-1911.  0.637
2008 Angluin D, Aspnes J, Fischer MJ, Jiang H. Self-stabilizing population protocols Acm Transactions On Autonomous and Adaptive Systems. 3. DOI: 10.1145/1452001.1452003  0.318
2008 Angluin D, Chen J. Learning a hidden graph using O (log n) queries per edge Journal of Computer and System Sciences. 74: 546-556. DOI: 10.1016/j.jcss.2007.06.006  0.368
2008 Angluin D, Aspnes J, Chen J, Reyzin L. Learning large-alphabet and analog circuits with value injection queries Machine Learning. 72: 113-138. DOI: 10.1007/S10994-008-5048-8  0.694
2008 Angluin D, Becerra-Bonache L. Learning meaning before syntax Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5278: 1-14. DOI: 10.1007/978-3-540-88009-7_1  0.376
2006 Angluin D, Aspnes J, Diamadi Z, Fischer MJ, Peralta R. Computation in networks of passively mobile finite-state sensors Distributed Computing. 18: 235-253. DOI: 10.1007/S00446-005-0138-3  0.335
2004 Angluin D. Queries revisited Theoretical Computer Science. 313: 175-194. DOI: 10.1016/J.Tcs.2003.11.004  0.434
2004 Angluin D, Chen J. Learning a hidden graph using O(log n) queries per edge Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 3120: 210-223. DOI: 10.1016/J.Jcss.2007.06.006  0.437
2003 Angluin D, Kriķis M. Learning from different teachers Machine Learning. 51: 137-163. DOI: 10.1023/A:1022854802097  0.375
2000 Angluin D, Westbrook J, Zhu W. Robot navigation with distance queries Siam Journal On Computing. 30: 110-144. DOI: 10.1137/S0097539797330057  0.311
1997 Angluin D, Kriķis M, Sloan RH, Turán G. Malicious Omissions and Errors in Answers to Membership Queries Machine Learning. 28: 211-255. DOI: 10.1023/A:1007311411259  0.481
1996 Angluin D. A 1996 snapshot of computational learning theory Acm Computing Surveys. 28: 216. DOI: 10.1145/242224.242501  0.387
1995 Dean T, Angluin D, Basye K, Engelson S, Kaelbling L, Kokkevis E, Maron O. Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning Machine Learning. 18: 81-108. DOI: 10.1023/A:1022874607797  0.361
1994 Angluin D, Slonim DK. Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle Machine Learning. 14: 7-26. DOI: 10.1023/A:1022642604085  0.401
1993 Angluin D, Hellerstein L, Karpinski M. Learning read-once formulas with queries Journal of the Acm. 40: 185-210. DOI: 10.1145/138027.138061  0.405
1992 Angluin D, Frazier M, Pitt L. Learning Conjunctions of Horn Clauses Machine Learning. 9: 147-164. DOI: 10.1023/A:1022689015665  0.391
1992 Angluin D. Computational learning theory: Survey and selected bibliography Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 351-369.  0.354
1990 Angluin D. Negative Results for Equivalence Queries Machine Learning. 5: 121-150. DOI: 10.1023/A:1022692615781  0.393
1988 Angluin D, Laird P. Learning From Noisy Examples Machine Learning. 2: 343-370. DOI: 10.1023/A:1022873112823  0.41
1988 Angluin D. Queries and Concept Learning Machine Learning. 2: 319-342. DOI: 10.1023/A:1022821128753  0.47
1987 Angluin D. Learning regular sets from queries and counterexamples Information and Computation. 75: 87-106. DOI: 10.1016/0890-5401(87)90052-6  0.473
1984 Angluin D, Hoover DN. Regular prefix relations Mathematical Systems Theory. 17: 167-191. DOI: 10.1007/Bf01744439  0.315
1981 Angluin D. A note on the number of queries needed to identify regular languages Information and Control. 51: 76-87. DOI: 10.1016/S0019-9958(81)90090-5  0.382
1980 Angluin D. On counting problems and the polynomial-time hierarchy☆ Theoretical Computer Science. 12: 161-173. DOI: 10.1016/0304-3975(80)90027-4  0.342
1980 Angluin D. Finding patterns common to a set of strings Journal of Computer and System Sciences. 21: 46-62. DOI: 10.1016/0022-0000(80)90041-0  0.307
1979 Angluin D, Valiant LG. Fast probabilistic algorithms for hamiltonian circuits and matchings Journal of Computer and System Sciences. 18: 155-193. DOI: 10.1016/0022-0000(79)90045-X  0.388
1978 Angluin D. On the complexity of minimum inference of regular sets Information and Control. 39: 337-350. DOI: 10.1016/S0019-9958(78)90683-6  0.34
1977 Angluin D, Valiant LG. Fast probabilistic algorithms for Hamiltonian circuits and hatchings Proceedings of the Annual Acm Symposium On Theory of Computing. 2: 30-41. DOI: 10.1145/800105.803393  0.306
Show low-probability matches.