The four Russians' algorithm for boolean matrix multiplication is optimal in its class. - Dana Angluin (SIGACT News, 1976)

On the Complexity of Minimum Inference of Regular Sets - Dana Angluin (Inf. Control., 1978)

Finding Patterns Common to a Set of Strings (Extended Abstract) - Dana Angluin (STOC, 1979)

A Note on a Construction of Margulis. - Dana Angluin (Inf. Process. Lett., 1979)

Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. - Dana Angluin; Leslie G. Valiant (J. Comput. Syst. Sci., 1979)

Local and Global Properties in Networks of Processors (Extended Abstract) - Dana Angluin (STOC, 1980)

Finding Patterns Common to a Set of Strings. - Dana Angluin (J. Comput. Syst. Sci., 1980)

On Relativizing Auxiliary Pushdown Machines. - Dana Angluin (Math. Syst. Theory, 1980)

On Counting Problems and the Polynomial-Time Hierarchy. - Dana Angluin (Theor. Comput. Sci., 1980)

Inductive Inference of Formal Languages from Positive Data - Dana Angluin (Inf. Control., 1980)

Finite common coverings of pairs of regular graphs. - Dana Angluin; A. Gardiner (J. Comb. Theory B, 1981)

A Note on the Number of Queries Needed to Identify Regular Languages - Dana Angluin (Inf. Control., 1981)

Two Notions of Correctness and Their Relation to Testing. - Timothy A. Budd; Dana Angluin (Acta Informatica, 1982)

Inference of Reversible Languages. - Dana Angluin (J. ACM, 1982)

Inductive Inference: Theory and Methods. - Dana Angluin; Carl H. Smith (ACM Comput. Surv., 1983)

Regular Prefix Relations. - Dana Angluin; Douglas N. Hoover (Math. Syst. Theory, 1984)

Queries and Concept Learning. - Dana Angluin (Mach. Learn., 1987)

Learning From Noisy Examples. - Dana Angluin; Philip D. Laird (Mach. Learn., 1987)

Learning Regular Sets from Queries and Counterexamples - Dana Angluin (Inf. Comput., 1987)

Learning With Hints. - Dana Angluin (COLT, 1988)

Equivalence Queries and Approximate Fingerprints. - Dana Angluin (COLT, 1989)

Training Sequences. - Dana Angluin; William I. Gasarch; Carl H. Smith (Theor. Comput. Sci., 1989)

Learning Conjunctions of Horn Clauses (Abstract). - Dana Angluin; Michael Frazier; Leonard Pitt (COLT, 1990)

Learning Conjunctions of Horn Clauses (Extended Abstract) - Dana Angluin; Michael Frazier; Leonard Pitt (FOCS, 1990)

Negative Results for Equivalence Queries. - Dana Angluin (Mach. Learn., 1990)

Learning Monotone DNF with an Incomplete Membership Oracle. - Dana Angluin; Donna K. Slonim (COLT, 1991)

When Won't Membership Queries Help? (Extended Abstract) - Dana Angluin; Michael Kharitonov (STOC, 1991)

Computational Learning Theory: Survey and Selected Bibliography - Dana Angluin (STOC, 1992)

Learning Conjunctions of Horn Clauses. - Dana Angluin; Michael Frazier; Leonard Pitt (Mach. Learn., 1992)

Learning Read-Once Formulas with Queries. - Dana Angluin; Lisa Hellerstein; Marek Karpinski (J. ACM, 1993)

Learning with Malicious Membership Queries and Exceptions (Extended Abstract). - Dana Angluin; Martins Krikis (COLT, 1994)

Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle. - Dana Angluin; Donna K. Slonim (Mach. Learn., 1994)

When Won't Membership Queries Help? - Dana Angluin; Michael Kharitonov (J. Comput. Syst. Sci., 1995)

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 (Mach. Learn., 1995)

Robot Navigation with Range Queries. - Dana Angluin; Jeffery R. Westbrook; Wenhong Zhu (STOC, 1996)

A 1996 Snapshot of Computational Learning Theory. - Dana Angluin (ACM Comput. Surv., 1996)

Learning Markov Chains with Variable Memory Length from Noisy Output. - Dana Angluin; Miklós Csürös (COLT, 1997)

Teachers, Learners and Black Boxes. - Dana Angluin; Martins Krikis (COLT, 1997)

Malicious Omissions and Errors in Answers to Membership Queries. - Dana Angluin; Martins Krikis; Robert H. Sloan; György Turán (Mach. Learn., 1997)

Robot Navigation with Distance Queries. - Dana Angluin; Jeffery R. Westbrook; Wenhong Zhu (SIAM J. Comput., 2000)

Robot localization in a grid. - Chinda Wongngamnit; Dana Angluin (Inf. Process. Lett., 2001)

Learning from Different Teachers. - Dana Angluin; Martins Krikis (Mach. Learn., 2003)

Learning a Hidden Graph Using O(log n) Queries Per Edge. - Dana Angluin; Jiang Chen (COLT, 2004)

Learning and Mathematics. - Dana Angluin (ICGI, 2004)

Queries revisited. - Dana Angluin (Theor. Comput. Sci., 2004)

Stably Computable Properties of Network Graphs. - Dana Angluin; James Aspnes; Melody Chan; Michael J. Fischer; Hong Jiang; René Peralta 001 (DCOSS, 2005)

On the Power of Anonymous One-Way Communication. - Dana Angluin; James Aspnes; David Eisenstat; Eric Ruppert (OPODIS, 2005)

Fast construction of overlay networks. - Dana Angluin; James Aspnes; Jiang Chen; Yinghua Wu; Yitong Yin (SPAA, 2005)

Stabilizing Consensus in Mobile Networks. - Dana Angluin; Michael J. Fischer; Hong Jiang (DCOSS, 2006)

Stably computable predicates are semilinear. - Dana Angluin; James Aspnes; David Eisenstat (PODC, 2006)

Computation in networks of passively mobile finite-state sensors. - Dana Angluin; James Aspnes; Zoë Diamadi; Michael J. Fischer; René Peralta 001 (Distributed Comput., 2006)

Learning a Hidden Hypergraph. - Dana Angluin; Jiang Chen (J. Mach. Learn. Res., 2006)

The computational power of population protocols. - Dana Angluin; James Aspnes; David Eisenstat; Eric Ruppert (Distributed Comput., 2007)

The VC dimension of k-fold union. - David Eisenstat; Dana Angluin (Inf. Process. Lett., 2007)

Learning Meaning Before Syntax. - Dana Angluin; Leonor Becerra-Bonache (ICGI, 2008)

A simple population protocol for fast robust approximate majority. - Dana Angluin; James Aspnes; David Eisenstat (Distributed Comput., 2008)

Fast computation by population protocols with a leader. - Dana Angluin; James Aspnes; David Eisenstat (Distributed Comput., 2008)

Learning a hidden graph using O(logn) queries per edge. - Dana Angluin; Jiang Chen (J. Comput. Syst. Sci., 2008)

Learning large-alphabet and analog circuits with value injection queries. - Dana Angluin; James Aspnes; Jiang Chen; Lev Reyzin (Mach. Learn., 2008)

Self-stabilizing population protocols. - Dana Angluin; James Aspnes; Michael J. Fischer; Hong Jiang (ACM Trans. Auton. Adapt. Syst., 2008)

Learning Finite Automata Using Label Queries. - Dana Angluin; Leonor Becerra-Bonache; Adrian-Horia Dediu; Lev Reyzin (ALT, 2009)

Learning a circuit by injecting values. - Dana Angluin; James Aspnes; Jiang Chen; Yinghua Wu (J. Comput. Syst. Sci., 2009)

Learning Acyclic Probabilistic Circuits Using Test Paths. - Dana Angluin; James Aspnes; Jiang Chen; David Eisenstat; Lev Reyzin (J. Mach. Learn. Res., 2009)

Inferring Social Networks from Outbreaks. - Dana Angluin; James Aspnes; Lev Reyzin (ALT, 2010)

Lower Bounds on Learning Random Structures with Statistical Queries. - Dana Angluin; David Eisenstat; Leonid Kontorovich; Lev Reyzin (ALT, 2010)

Storage Capacity of Labeled Graphs. - Dana Angluin; James Aspnes; Rida A. Bazzi; Jiang Chen; David Eisenstat; Goran Konjevod (SSS, 2010)

Optimally learning social networks with activations and suppressions. - Dana Angluin; James Aspnes; Lev Reyzin (Theor. Comput. Sci., 2010)

Effects of Meaning-Preserving Corrections on Language Learning. - Dana Angluin; Leonor Becerra-Bonache (CoNLL, 2011)

An Overview of How Semantics and Corrections Can Help Language Learning. - Dana Angluin; Leonor Becerra-Bonache (Web Intelligence/IAT Workshops, 2011)

On the Learnability of Shuffle Ideals. - Dana Angluin; James Aspnes; Aryeh Kontorovich (ALT, 2012)

Learning and verifying quantified boolean queries by example. - Azza Abouzied; Dana Angluin; Christos H. Papadimitriou; Joseph M. Hellerstein; Avi Silberschatz (PODS, 2013)

Mutation systems. - Dana Angluin; James Aspnes; Raonne Barbosa Vargas (Int. J. Comput. Math., 2013)

On the learnability of shuffle ideals. - Dana Angluin; James Aspnes; Sarah Eisenstat; Aryeh Kontorovich (J. Mach. Learn. Res., 2013)

Effective storage capacity of labeled graphs. - Dana Angluin; James Aspnes; Rida A. Bazzi; Jiang Chen; David Eisenstat; Goran Konjevod (Inf. Comput., 2014)

Learning a Random DFA from Uniform Strings and State Information. - Dana Angluin; Dongqu Chen (ALT, 2015)

Learning Regular Languages via Alternating Automata. - Dana Angluin; Sarah Eisenstat; Dana Fisman (IJCAI, 2015)

Network construction with subgraph connectivity constraints. - Dana Angluin; James Aspnes; Lev Reyzin (J. Comb. Optim., 2015)

Families of DFAs as Acceptors of omega-Regular Languages. - Dana Angluin; Udi Boker; Dana Fisman (MFCS, 2016)

Learning regular omega languages. - Dana Angluin; Dana Fisman (Theor. Comput. Sci., 2016)

Query Learning of Derived Omega-Tree Languages in Polynomial Time. - Dana Angluin; Timos Antonopoulos; Dana Fisman (CSL, 2017)

A model of language learning with semantics and meaning-preserving corrections. - Dana Angluin; Leonor Becerra-Bonache (Artif. Intell., 2017)

Context-Free Transductions with Neural Stacks. - Yiding Hao; William Merrill; Dana Angluin; Robert Frank 001; Noah Amsel; Andrew Benz; Simon Mendelsohn (BlackboxNLP@EMNLP, 2018)

Query learning of derived ω-tree languages in polynomial time. - Dana Angluin; Timos Antonopoulos; Dana Fisman (CoRR, 2018)

Regular omega-Languages with an Informative Right Congruence. - Dana Angluin; Dana Fisman (GandALF, 2018)

Families of DFAs as Acceptors of ω-Regular Languages. - Dana Angluin; Udi Boker; Dana Fisman (Log. Methods Comput. Sci., 2018)

Query learning of derived ωω omega-tree languages in polynomial time. - Dana Angluin; Timos Antonopoulos; Dana Fisman (Log. Methods Comput. Sci., 2019)

Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries. - Dana Angluin; Timos Antonopoulos; Dana Fisman (CSL, 2020)

Polynomial Identification of ømega-Automata. - Dana Angluin; Dana Fisman; Yaara Shoval (TACAS (2), 2020)

Polynomial time algorithms for inclusion and equivalence of deterministic omega acceptors. - Dana Angluin; Dana Fisman (CoRR, 2020)

The power of random counterexamples. - Dana Angluin; Tyler Dohrn (Theor. Comput. Sci., 2020)

Regular ω-languages with an informative right congruence. - Dana Angluin; Dana Fisman (Inf. Comput., 2021)

Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. - Dana Angluin; Timos Antonopoulos; Dana Fisman; Nevin George (FoSSaCS, 2022)

Formal Language Recognition by Hard Attention Transformers: Perspectives from Circuit Complexity. - Yiding Hao; Dana Angluin; Robert Frank 001 (Trans. Assoc. Comput. Linguistics, 2022)

Learning of Regular Languages by Recurrent Neural Networks? (Mainly Questions). - Dana Angluin (ICGI, 2023)

Masked Hard-Attention Transformers and Boolean RASP Recognize Exactly the Star-Free Languages. - Dana Angluin; David Chiang 001; Andy Yang (CoRR, 2023)

Transformers as Recognizers of Formal Languages: A Survey on Expressivity. - Lena Strobl; William Merrill; Gail Weiss; David Chiang 001; Dana Angluin (CoRR, 2023)

Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages. - Andy Yang; David Chiang 001; Dana Angluin (NeurIPS, 2024)

Simulating Hard Attention Using Soft Attention. - Andy Yang; Lena Strobl; David Chiang 001; Dana Angluin (CoRR, 2024)

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages. - Dana Angluin; Dana Fisman (Log. Methods Comput. Sci., 2024)

What Formal Languages Can Transformers Express? A Survey. - Lena Strobl; William Merrill; Gail Weiss; David Chiang 001; Dana Angluin (Trans. Assoc. Comput. Linguistics, 2024)

Transformers as Transducers. - Lena Strobl; Dana Angluin; David Chiang 001; Jonathan Rawski; Ashish Sabharwal (Trans. Assoc. Comput. Linguistics, 2025)

Concise One-Layer Transformers Can Do Function Evaluation (Sometimes). - Lena Strobl; Dana Angluin; Robert Frank 001 (CoRR, 2025)