Children
Sign in to add trainee| Miklos Csuros | grad student | 2000 | Yale |
| Jiang Chen | grad student | 2006 | Yale |
| Lev Reyzin | grad student | 2009 | Yale |
| Sophie Hao | grad student | 2017-2022 | Yale (LinguisTree) |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Angluin D, Dohrn T. (2020) The power of random counterexamples Theoretical Computer Science. 808: 2-13 |
| Angluin D, Becerra-Bonache L. (2017) A model of language learning with semantics and meaning-preserving corrections Artificial Intelligence. 242: 23-51 |
| Angluin D, Chen D. (2015) 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 |
| Angluin D, Eisenstat S, Fisman D. (2015) Learning regular languages via alternating automata Ijcai International Joint Conference On Artificial Intelligence. 2015: 3308-3314 |
| Angluin D, Fisman D. (2014) Learning regular omega languages Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8776: 125-139 |
| Angluin D, Aspnes J, Bazzi RA, et al. (2014) Effective storage capacity of labeled graphs Information and Computation. 234: 44-56 |
| Abouzied A, Angluin D, Papadimitriou C, et al. (2013) Learning and verifying quantified boolean queries by example Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 49-60 |
| Angluin D, Aspnes J, Reyzin L. (2013) Network construction with subgraph connectivity constraints Journal of Combinatorial Optimization. 29: 418-432 |
| Angluin D, Aspnes J, Eisenstat S, et al. (2013) On the learnability of shuffle ideals Journal of Machine Learning Research. 14: 1513-1531 |
| Angluin D, Aspnes J, Reyzin L. (2010) Optimally learning social networks with activations and suppressions Theoretical Computer Science. 411: 2729-2740 |