| 2022 | FOSSACS | Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. | Dana Angluin, Timos Antonopoulos, Dana Fisman, Nevin George |
| 2020 | CSL | Strongly Unambiguous Bchi Automata Are Polynomially Predictable With Membership Queries. | Dana Angluin, Timos Antonopoulos, Dana Fisman |
| 2020 | TACAS | Polynomial Identification of mega-Automata. | Dana Angluin, Dana Fisman, Yaara Shoval |
| 2018 | EMNLP | Context-Free Transductions with Neural Stacks. | Yiding Hao, William Merrill, Dana Angluin, Robert Frank, Noah Amsel, Andrew Benz, Simon Mendelsohn |
| 2017 | ALT | The Power of Random Counterexamples. | Dana Angluin, Tyler Dohrn |
| 2017 | CSL | Query Learning of Derived Omega-Tree Languages in Polynomial Time. | Dana Angluin, Timos Antonopoulos, Dana Fisman |
| 2016 | MFCS | Families of DFAs as Acceptors of omega-Regular Languages. | Dana Angluin, Udi Boker, Dana Fisman |
| 2015 | ALT | Learning a Random DFA from Uniform Strings and State Information. | Dana Angluin, Dongqu Chen |
| 2015 | IJCAI | Learning Regular Languages via Alternating Automata. | Dana Angluin, Sarah Eisenstat, Dana Fisman |
| 2014 | ALT | Learning Regular Omega Languages. | Dana Angluin, Dana Fisman |
| 2013 | PODS | Learning and verifying quantified boolean queries by example. | Azza Abouzied, Dana Angluin, Christos H. Papadimitriou, Joseph M. Hellerstein, Avi Silberschatz |
| 2012 | ALT | On the Learnability of Shuffle Ideals. | Dana Angluin, James Aspnes, Aryeh Kontorovich |
| 2011 | CoNLL | Effects of Meaning-Preserving Corrections on Language Learning. | Dana Angluin, Leonor Becerra-Bonache |
| 2011 | LATA | Mutation Systems. | Dana Angluin, James Aspnes, Raonne Barbosa Vargas |
| 2010 | ALT | Inferring Social Networks from Outbreaks. | Dana Angluin, James Aspnes, Lev Reyzin |
| 2010 | ALT | Lower Bounds on Learning Random Structures with Statistical Queries. | Dana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin |
| 2010 | SSS | Storage Capacity of Labeled Graphs. | Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod |
| 2009 | ALT | Learning Finite Automata Using Label Queries. | Dana Angluin, Leonor Becerra-Bonache, Adrian-Horia Dediu, Lev Reyzin |
| 2008 | ALT | Optimally Learning Social Networks with Activations and Suppressions. | Dana Angluin, James Aspnes, Lev Reyzin |
| 2008 | COLT | Learning Acyclic Probabilistic Circuits Using Test Paths. | Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin |
| 2007 | COLT | Learning Large-Alphabet and Analog Circuits with Value Injection Queries. | Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin |
| 2006 | DCOSS | Stabilizing Consensus in Mobile Networks. | Dana Angluin, Michael J. Fischer, Hong Jiang |
| 2006 | PODC | Stably computable predicates are semilinear. | Dana Angluin, James Aspnes, David Eisenstat |
| 2006 | STOC | Learning a circuit by injecting values. | Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu |
| 2005 | COLT | Learning a Hidden Hypergraph. | Dana Angluin, Jiang Chen |
| 2005 | DCOSS | Stably Computable Properties of Network Graphs. | Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, Ren Peralta |
| 2005 | OPODIS | On the Power of Anonymous One-Way Communication. | Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert |
| 2005 | OPODIS | Self-stabilizing Population Protocols. | Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang |
| 2005 | SPAA | Fast construction of overlay networks. | Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin |
| 2004 | COLT | Learning a Hidden Graph Using O(log n) Queries Per Edge. | Dana Angluin, Jiang Chen |
| 2004 | PODC | Computation in networks of passively mobile finite-state sensors. | Dana Angluin, James Aspnes, Zo Diamadi, Michael J. Fischer, Ren Peralta |
| 2001 | ALT | Queries Revisited. | Dana Angluin |
| 2001 | DIS | Queries Revisited. | Dana Angluin |
| 1997 | COLT | Learning Markov Chains with Variable Memory Length from Noisy Output. | Dana Angluin, Mikls Csrs |
| 1997 | COLT | Teachers, Learners and Black Boxes. | Dana Angluin, Martins Krikis |
| 1996 | STOC | Robot Navigation with Range Queries. | Dana Angluin, Jeffery R. Westbrook, Wenhong Zhu |
| 1994 | COLT | Learning with Malicious Membership Queries and Exceptions (Extended Abstract). | Dana Angluin, Martins Krikis |
| 1992 | AAAI | Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning. | Thomas L. Dean, Dana Angluin, Kenneth Basye, Sean P. Engelson, Leslie Pack Kaelbling, Evangelos Kokkevis, Oded Maron |
| 1992 | STOC | Computational Learning Theory: Survey and Selected Bibliography | Dana Angluin |
| 1991 | COLT | Learning Monotone DNF with an Incomplete Membership Oracle. | Dana Angluin, Donna K. Slonim |
| 1991 | STOC | When Won't Membership Queries Help? (Extended Abstract) | Dana Angluin, Michael Kharitonov |
| 1990 | COLT | Learning Conjunctions of Horn Clauses (Abstract). | Dana Angluin, Michael Frazier, Leonard Pitt |
| 1990 | FOCS | Learning Conjunctions of Horn Clauses (Extended Abstract) | Dana Angluin, Michael Frazier, Leonard Pitt |
| 1989 | COLT | Equivalence Queries and Approximate Fingerprints. | Dana Angluin |
| 1988 | COLT | Learning With Hints. | Dana Angluin |
| 1980 | STOC | Local and Global Properties in Networks of Processors (Extended Abstract) | Dana Angluin |
| 1979 | STOC | Finding Patterns Common to a Set of Strings (Extended Abstract) | Dana Angluin |
| 1977 | STOC | Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings | Dana Angluin, Leslie G. Valiant |