Dana Angluin
According to our database1,
Dana Angluin
authored at least 103 papers
between 1977 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:
On csauthors.net:
Bibliography
2018
Families of DFAs as Acceptors of ω-Regular Languages.
Logical Methods in Computer Science, 2018
Regular omega-Languages with an Informative Right Congruence.
Proceedings of the Proceedings Ninth International Symposium on Games, 2018
Context-Free Transductions with Neural Stacks.
CoRR, 2018
Query learning of derived ω-tree languages in polynomial time.
CoRR, 2018
2017
A model of language learning with semantics and meaning-preserving corrections.
Artif. Intell., 2017
Query Learning of Derived Omega-Tree Languages in Polynomial Time.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017
The Power of Random Counterexamples.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017
2016
Learning regular omega languages.
Theor. Comput. Sci., 2016
Families of DFAs as Acceptors of $ω$-Regular Languages.
CoRR, 2016
Families of DFAs as Acceptors of omega-Regular Languages.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
2015
Network construction with subgraph connectivity constraints.
J. Comb. Optim., 2015
Learning Regular Languages via Alternating Automata.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
Learning a Random DFA from Uniform Strings and State Information.
Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015
2014
Effective storage capacity of labeled graphs.
Inf. Comput., 2014
Learning Regular Omega Languages.
Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014
2013
On the learnability of shuffle ideals.
Journal of Machine Learning Research, 2013
Mutation systems.
Int. J. Comput. Math., 2013
Learning and Verifying Quantified Boolean Queries by Example
CoRR, 2013
Learning and verifying quantified boolean queries by example.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013
2012
On the Learnability of Shuffle Ideals.
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012
2011
Mutation Systems.
Proceedings of the Language and Automata Theory and Applications, 2011
An Overview of How Semantics and Corrections Can Help Language Learning.
Proceedings of the 2011 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, 2011
Effects of Meaning-Preserving Corrections on Language Learning.
Proceedings of the Fifteenth Conference on Computational Natural Language Learning, 2011
2010
Optimally learning social networks with activations and suppressions.
Theor. Comput. Sci., 2010
Storage Capacity of Labeled Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010
Lower Bounds on Learning Random Structures with Statistical Queries.
Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010
Inferring Social Networks from Outbreaks.
Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010
2009
Learning Acyclic Probabilistic Circuits Using Test Paths.
Journal of Machine Learning Research, 2009
Learning a circuit by injecting values.
J. Comput. Syst. Sci., 2009
Learning Finite Automata Using Label Queries.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009
2008
Self-stabilizing population protocols.
TAAS, 2008
Learning large-alphabet and analog circuits with value injection queries.
Machine Learning, 2008
Learning a hidden graph using O(logn) queries per edge.
J. Comput. Syst. Sci., 2008
Fast computation by population protocols with a leader.
Distributed Computing, 2008
A simple population protocol for fast robust approximate majority.
Distributed Computing, 2008
Learning Meaning Before Syntax.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2008
Learning Acyclic Probabilistic Circuits Using Test Paths.
Proceedings of the 21st Annual Conference on Learning Theory, 2008
Optimally Learning Social Networks with Activations and Suppressions.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008
2007
The VC dimension of k-fold union.
Inf. Process. Lett., 2007
The computational power of population protocols.
Distributed Computing, 2007
A Simple Population Protocol for Fast Robust Approximate Majority.
Proceedings of the Distributed Computing, 21st International Symposium, 2007
Learning Large-Alphabet and Analog Circuits with Value Injection Queries.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007
2006
Learning a Hidden Hypergraph.
Journal of Machine Learning Research, 2006
Computation in networks of passively mobile finite-state sensors.
Distributed Computing, 2006
The computational power of population protocols
CoRR, 2006
Fast Computation by Population Protocols with a Leader.
Proceedings of the Distributed Computing, 20th International Symposium, 2006
Learning a circuit by injecting values.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
Stably computable predicates are semilinear.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006
Stabilizing Consensus in Mobile Networks.
Proceedings of the Distributed Computing in Sensor Systems, 2006
2005
Fast construction of overlay networks.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005
Self-stabilizing Population Protocols.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005
On the Power of Anonymous One-Way Communication.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005
Stably Computable Properties of Network Graphs.
Proceedings of the Distributed Computing in Sensor Systems, 2005
Learning a Hidden Hypergraph.
Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005
2004
Queries revisited.
Theor. Comput. Sci., 2004
Computation in networks of passively mobile finite-state sensors.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004
Learning and Mathematics.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004
Learning a Hidden Graph Using O(log n) Queries Per Edge.
Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004
2003
Learning from Different Teachers.
Machine Learning, 2003
2001
Robot localization in a grid.
Inf. Process. Lett., 2001
Queries Revisited.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001
Queries Revisited.
Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001
2000
Robot Navigation with Distance Queries.
SIAM J. Comput., 2000
1997
Malicious Omissions and Errors in Answers to Membership Queries.
Machine Learning, 1997
Teachers, Learners and Black Boxes.
Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997
Learning Markov Chains with Variable Memory Length from Noisy Output.
Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997
1996
A 1996 Snapshot of Computational Learning Theory.
ACM Comput. Surv., 1996
Robot Navigation with Range Queries.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996
1995
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning.
Machine Learning, 1995
When Won't Membership Queries Help?
J. Comput. Syst. Sci., 1995
1994
Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle.
Machine Learning, 1994
Learning with Malicious Membership Queries and Exceptions (Extended Abstract).
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994
1993
Learning Read-Once Formulas with Queries.
J. ACM, 1993
1992
Learning Conjunctions of Horn Clauses.
Machine Learning, 1992
Computational Learning Theory: Survey and Selected Bibliography
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992
1991
When Won't Membership Queries Help? (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
Learning Monotone DNF with an Incomplete Membership Oracle.
Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991
1990
Negative Results for Equivalence Queries.
Machine Learning, 1990
Learning Conjunctions of Horn Clauses (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
Learning Conjunctions of Horn Clauses (Abstract).
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990
1989
Training Sequences.
Theor. Comput. Sci., 1989
Equivalence Queries and Approximate Fingerprints.
Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989
1988
Learning With Hints.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988
1987
Learning Regular Sets from Queries and Counterexamples
Inf. Comput., November, 1987
Learning From Noisy Examples.
Machine Learning, 1987
Queries and Concept Learning.
Machine Learning, 1987
1984
Regular Prefix Relations.
Mathematical Systems Theory, 1984
1983
Inductive Inference: Theory and Methods.
ACM Comput. Surv., 1983
1982
Inference of Reversible Languages.
J. ACM, 1982
Two Notions of Correctness and Their Relation to Testing.
Acta Inf., 1982
1981
A Note on the Number of Queries Needed to Identify Regular Languages
Information and Control, October, 1981
Finite common coverings of pairs of regular graphs.
J. Comb. Theory, Ser. B, 1981
1980
Inductive Inference of Formal Languages from Positive Data
Information and Control, May, 1980
On Counting Problems and the Polynomial-Time Hierarchy.
Theor. Comput. Sci., 1980
On Relativizing Auxiliary Pushdown Machines.
Mathematical Systems Theory, 1980
Finding Patterns Common to a Set of Strings.
J. Comput. Syst. Sci., 1980
Local and Global Properties in Networks of Processors (Extended Abstract)
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980
1979
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings.
J. Comput. Syst. Sci., 1979
A Note on a Construction of Margulis.
Inf. Process. Lett., 1979
Finding Patterns Common to a Set of Strings (Extended Abstract)
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979
1978
On the Complexity of Minimum Inference of Regular Sets
Information and Control, December, 1978
1977
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977