Dana Angluin | Academic Influence

Dana Angluin's AcademicInfluence.com Rankings

Dana Angluin

Computer Science

#518

World Rank

#538

Historical Rank

#286

USA Rank

Database

#2085

World Rank

#2192

Historical Rank

#491

USA Rank

computer-science Degrees

Download Badge

Computer Science

Dana Angluin's Degrees

PhD Computer Science University of California, Berkeley
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Why Is Dana Angluin Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Dana Angluin is a professor emeritus of computer science at Yale University. She is known for foundational work in computational learning theory and distributed computing. Education Angluin received her B.A. and Ph.D. at University of California, Berkeley. Her thesis, entitled "An application of the theory of computational complexity to the study of inductive inference" was one of the first works to apply complexity theory to the field of inductive inference. Angluin joined the faculty at Yale in 1979.

(See a Problem?)

Dana Angluin's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Learning Regular Sets from Queries and Counterexamples (1987) (2143)
Queries and concept learning (1988) (1230)
Inductive Inference: Theory and Methods (1983) (916)
Inductive Inference of Formal Languages from Positive Data (1980) (809)
Fast probabilistic algorithms for hamiltonian circuits and matchings (1977) (726)
Computation in networks of passively mobile finite-state sensors (2004) (590)
Finding Patterns Common to a Set of Strings (1980) (575)
Learning From Noisy Examples (1988) (569)
Inference of Reversible Languages (1982) (530)
Local and global properties in networks of processors (Extended Abstract) (1980) (525)
Queries and Concept Learning (2004) (361)
The computational power of population protocols (2006) (291)
On the Complexity of Minimum Inference of Regular Sets (1978) (276)
When won't membership queries help? (1991) (232)
Fast computation by population protocols with a leader (2006) (225)
Queries revisited (2001) (222)
Learning conjunctions of Horn clauses (1990) (219)
Computational learning theory: survey and selected bibliography (1992) (217)
A Note on the Number of Queries Needed to Identify Regular Languages (1981) (210)
A simple population protocol for fast robust approximate majority (2007) (208)
Two notions of correctness and their relation to testing (1982) (206)
Learning read-once formulas with queries (1993) (200)
Self-stabilizing population protocols (2005) (160)
Stably computable predicates are semilinear (2006) (149)
Learning from noisy examples (1988) (137)
Negative Results for Equivalence Queries (1990) (108)
Stably Computable Properties of Network Graphs (2005) (91)
Finding patterns common to a set of strings (Extended Abstract) (1979) (76)
Learning and verifying quantified boolean queries by example (2013) (72)
On Counting Problems and the Polynomial-Time Hierarchy (1980) (70)
Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle (1991) (65)
Finite common coverings of pairs of regular graphs (1981) (65)
Inferring finite automata with stochastic output functions and an application to map learning (1992) (60)
Learning regular omega languages (2014) (56)
Negative results for equivalence queries (1990) (55)
Fast construction of overlay networks (2005) (55)
Stabilizing Consensus in Mobile Networks (2006) (51)
Learning a Hidden Graph Using O(log n) Queries Per Edge (2004) (50)
Learning with hints (1988) (49)
Learning a hidden graph using O(logn) queries per edge (2008) (49)
Learning a Hidden Hypergraph (2005) (46)
Learning Regular Languages via Alternating Automata (2015) (42)
Inferring Social Networks from Outbreaks (2010) (38)
Learning from Different Teachers (2003) (31)
Equivalence queries and approximate fingerprints (1989) (29)
Context-Free Transductions with Neural Stacks (2018) (28)
Malicious Omissions and Errors in Answers to Membership Queries (1997) (28)
Teachers, learners and black boxes (1997) (28)
On the Power of Anonymous One-Way Communication (2005) (26)
The VC dimension of k-fold union (2007) (25)
Training Sequences (1989) (25)
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning (1992) (24)
Learning with malicious membership queries and exceptions (extended abstract) (1994) (23)
Robot navigation with range queries (1996) (20)
Families of DFAs as Acceptors of omega-Regular Languages (2016) (17)
Regular omega-Languages with an Informative Right Congruence (2018) (16)
Learning a circuit by injecting values (2006) (15)
Learning Meaning Before Syntax (2008) (15)
An application of the theory of computational complexity to the study of inductive inference. (1976) (15)
Network construction with subgraph connectivity constraints (2015) (15)
A Note on a Construction of Margulis (1979) (14)
Regular prefix relations (1984) (13)
Learning a Random DFA from Uniform Strings and State Information (2015) (12)
Effects of Meaning-Preserving Corrections on Language Learning (2011) (12)
Families of DFAs as Acceptors of $ω$-Regular Languages (2016) (11)
Exact learning of p-dnf formulas with malicious membership queries (1993) (11)
Formal Language Recognition by Hard Attention Transformers: Perspectives from Circuit Complexity (2022) (11)
The Power of Random Counterexamples (2017) (11)
Learning large-alphabet and analog circuits with value injection queries (2007) (11)
Optimally learning social networks with activations and suppressions (2008) (11)
Lower Bounds on Learning Random Structures with Statistical Queries (2010) (11)
The four Russians' algorithm for boolean matrix multiplication is optimal in its class (1976) (11)
Learning Markov chains with variable memory length from noisy output (1997) (10)
A Model of Semantics and Corrections in Language Learning (2010) (10)
Robot localization in a grid (2001) (10)
Learning Finite Automata Using Label Queries (2009) (9)
Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries (2020) (8)
Robot Navigation with Distance Queries (2000) (8)
On the learnability of shuffle ideals (2012) (7)
An Overview of How Semantics and Corrections Can Help Language Learning (2011) (6)
A model of language learning with semantics and meaning-preserving corrections (2017) (5)
Learning Acyclic Probabilistic Circuits Using Test Paths (2009) (5)
THE EXPRESSIVE POWER OF NEURAL NETWORKS (2018) (5)
Polynomial Identification of ømega-Automata (2020) (4)
Experiments with an Algorithm to Learn Meaning before Syntax (2008) (4)
Reference manual: QED Time - sharing editor (1968) (4)
When Won't Membership Queries Help? (Extended Abstract) (1991) (4)
The class DBW∩DCW of ω-languages is identifiable in the limit from positive data and membership queries with polynomial time and data (2016) (3)
Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle (1991) (3)
Query Learning of Derived Omega-Tree Languages in Polynomial Time (2018) (3)
Experiments Using OSTIA for a Language Production Task (2009) (3)
A 1996 snapshot of computational learning theory (1996) (2)
A Population Protocol for Binary Signaling Consensus (2016) (2)
Mutation systems (2011) (2)
Polynomial time algorithms for inclusion and equivalence of deterministic omega acceptors (2020) (2)
Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata (2022) (2)
Effective storage capacity of labeled graphs (2014) (2)
Learning from different teachers and imperfect queries (1998) (1)
Query learning of derived ω-tree languages in polynomial time (2018) (1)
On relativizing auxiliary pushdown machines (1979) (1)
Polynomial Identification of omega-Automata (2022) (1)
An Exploration of Gameplay in Quarto (2001) (1)
Learning conjunctions of horn clauses (abstract) (1990) (1)
Recognizing Textual Entailment : A Deep Semantic Approach via Dependency Parsing (2012) (1)
Learning Conjunctions of Horn Clauses (2004) (1)
Learning Conjunctions of Horn Clauses (Extended Abstract) (1990) (1)
Experiments using semantics for learning language comprehension and production (2011) (0)
HanziLiang : Modeling the Learning and Forgetting of Written Chinese Characters Will Tsui (2007) (0)
Learning via queries (2006) (0)
Storage Capacity of Labeled Graphs (2010) (0)
Polynomial time algorithms for inclusion and equivalence of deterministic parity acceptors (2020) (0)
Red Blood Cell Classification using Convolutional Networks Exploring Machine Learning Applications in Pathology (2016) (0)
Sequential neural networks as automata (2019) (0)
Exploring Ambiguity Detection and Generation for Poetry using Tree Adjoining Grammar (2017) (0)
Interim Report : Exploring Ambiguity Detection and Poetry Generation using Tree Adjoining Grammar (2017) (0)
Learning Conjunctions of Horn Clauses**An extended abstract of this paper appears in Proceedings of the 31st Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1990. (1990) (0)
Polynomial Identiﬁcation of ω -Automata (cid:3) (2020) (0)
Neural sequence models as automata computations (2018) (0)
[4] Reinforcement Learning for Planning and Control (2008) (0)
Recognizing Textual Entailment II : An Extension of a Deep Semantic Approach via Dependency Parsing (2013) (0)
RESEARCH ARTICLE Mutation systems (2012) (0)
Learning and Mathematics (2004) (0)
ite Automata wit an Application (1992) (0)
Malicious Membership Queries and Exceptions Malicious Membership Queries and Exceptions (1994) (0)
REFERENCE MANUAL FOR NARP, AN ASSEMBLER FOR THE SDS 940, (1968) (0)
New Haven , CT 06520 – 8285 Urn Automata (2006) (0)
Network construction with subgraph connectivity constraints (2013) (0)
Content Recommendation Systems : A Comparison of User-Based and Item-Based Approaches (2015) (0)

This paper list is powered by the following services:

Other Resources About Dana Angluin

en.wikipedia.org

What Schools Are Affiliated With Dana Angluin?

Dana Angluin is affiliated with the following schools: