Dana Angluin

Azza Abouzied, Dana Angluin, Christos H. Papadimitriou, Joseph M. Hellerstein, Avi Silberschatz: Learning and Verifying Quantified Boolean Queries by Example. CoRR abs/1304.4303 (2013)

Dana Angluin, James Aspnes, Aryeh Kontorovich: On the Learnability of Shuffle Ideals. ALT 2012: 111-123

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

Dana Angluin, James Aspnes, Raonne Barbosa Vargas: Mutation Systems. LATA 2011: 92-104

Dana Angluin, James Aspnes, Lev Reyzin: Optimally learning social networks with activations and suppressions. Theor. Comput. Sci. 411(29-30): 2729-2740 (2010)

Dana Angluin, James Aspnes, Lev Reyzin: Inferring Social Networks from Outbreaks. ALT 2010: 104-118

Dana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin: Lower Bounds on Learning Random Structures with Statistical Queries. ALT 2010: 194-208

Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod: Storage Capacity of Labeled Graphs. SSS 2010: 573-587

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

Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin: Learning Acyclic Probabilistic Circuits Using Test Paths. Journal of Machine Learning Research 10: 1881-1911 (2009)

Dana Angluin, Leonor Becerra-Bonache, Adrian Horia Dediu, Lev Reyzin: Learning Finite Automata Using Label Queries. ALT 2009: 171-185

Dana Angluin, James Aspnes, David Eisenstat: A simple population protocol for fast robust approximate majority. Distributed Computing 21(2): 87-102 (2008)

Dana Angluin, James Aspnes, David Eisenstat: Fast computation by population protocols with a leader. Distributed Computing 21(3): 183-199 (2008)

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

Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin: Learning large-alphabet and analog circuits with value injection queries. Machine Learning 72(1-2): 113-138 (2008)

Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang: Self-stabilizing population protocols. TAAS 3(4) (2008)

Dana Angluin, James Aspnes, Lev Reyzin: Optimally Learning Social Networks with Activations and Suppressions. ALT 2008: 272-286

Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin: Learning Acyclic Probabilistic Circuits Using Test Paths. COLT 2008: 169-180

Dana Angluin, Leonor Becerra-Bonache: Learning Meaning Before Syntax. ICGI 2008: 1-14

Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: The computational power of population protocols. Distributed Computing 20(4): 279-304 (2007)

David Eisenstat, Dana Angluin: The VC dimension of k-fold union. Inf. Process. Lett. 101(5): 181-184 (2007)

Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin: Learning Large-Alphabet and Analog Circuits with Value Injection Queries. COLT 2007: 51-65

Dana Angluin, James Aspnes, David Eisenstat: A Simple Population Protocol for Fast Robust Approximate Majority. DISC 2007: 20-32

Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta: Computation in networks of passively mobile finite-state sensors. Distributed Computing 18(4): 235-253 (2006)

Dana Angluin, Jiang Chen: Learning a Hidden Hypergraph. Journal of Machine Learning Research 7: 2215-2236 (2006)

Dana Angluin, Michael J. Fischer, Hong Jiang: Stabilizing Consensus in Mobile Networks. DCOSS 2006: 37-50

Dana Angluin, James Aspnes, David Eisenstat: Stably computable predicates are semilinear. PODC 2006: 292-299

Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu: Learning a circuit by injecting values. STOC 2006: 584-593

Dana Angluin, James Aspnes, David Eisenstat: Fast Computation by Population Protocols with a Leader. DISC 2006: 61-75

Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: The computational power of population protocols. CoRR abs/cs/0608084 (2006)

Dana Angluin, Jiang Chen: Learning a Hidden Hypergraph. COLT 2005: 561-575

Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta: Stably Computable Properties of Network Graphs. DCOSS 2005: 63-74

Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang: Self-stabilizing Population Protocols. OPODIS 2005: 103-117

Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: On the Power of Anonymous One-Way Communication. OPODIS 2005: 396-411

Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin: Fast construction of overlay networks. SPAA 2005: 145-154

Dana Angluin: Queries revisited. Theor. Comput. Sci. 313(2): 175-194 (2004)

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

Dana Angluin: Learning and Mathematics. ICGI 2004: 1-2

Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta: Computation in networks of passively mobile finite-state sensors. PODC 2004: 290-299

Dana Angluin, Martins Krikis: Learning from Different Teachers. Machine Learning 51(2): 137-163 (2003)

Chinda Wongngamnit, Dana Angluin: Robot localization in a grid. Inf. Process. Lett. 77(5-6): 261-267 (2001)

Dana Angluin: Queries Revisited. ALT 2001: 12-31

Dana Angluin: Queries Revisited. Discovery Science 2001: 16

Dana Angluin, Jeffery Westbrook, Wenhong Zhu: Robot Navigation with Distance Queries. SIAM J. Comput. 30(1): 110-144 (2000)

Dana Angluin, Martins Krikis, Robert H. Sloan, György Turán: Malicious Omissions and Errors in Answers to Membership Queries. Machine Learning 28(2-3): 211-255 (1997)

Dana Angluin, Martins Krikis: Teachers, Learners and Black Boxes. COLT 1997: 285-297

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

Dana Angluin: A 1996 Snapshot of Computational Learning Theory. ACM Comput. Surv. 28(4es): 216 (1996)

Dana Angluin, Jeffery Westbrook, Wenhong Zhu: Robot Navigation with Range Queries. STOC 1996: 469-478

Dana Angluin, Michael Kharitonov: When Won't Membership Queries Help? J. Comput. Syst. Sci. 50(2): 336-355 (1995)

Thomas L. Dean, Dana Angluin, Kenneth Basye, Sean P. Engelson, Leslie Pack Kaelbling, Evangelos Kokkevis, Oded Maron: Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning. Machine Learning 18(1): 81-108 (1995)

Dana Angluin, Donna K. Slonim: Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle. Machine Learning 14(1): 7-26 (1994)

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

Dana Angluin, Lisa Hellerstein, Marek Karpinski: Learning Read-Once Formulas with Queries. J. ACM 40(1): 185-210 (1993)

Dana Angluin, Michael Frazier, Leonard Pitt: Learning Conjunctions of Horn Clauses. Machine Learning 9: 147-164 (1992)

Thomas L. Dean, Dana Angluin, Kenneth Basye, Sean P. Engelson, Leslie Pack Kaelbling, Evangelos Kokkevis, Oded Maron: Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning. AAAI 1992: 208-214

Dana Angluin: Computational Learning Theory: Survey and Selected Bibliography. STOC 1992: 351-369

Dana Angluin, Donna K. Slonim: Learning Monotone DNF with an Incomplete Membership Oracle. COLT 1991: 139-146

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

Dana Angluin: Negative Results for Equivalence Queries. Machine Learning 5: 121-150 (1990)

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

Dana Angluin, Michael Frazier, Leonard Pitt: Learning Conjunctions of Horn Clauses (Extended Abstract). FOCS 1990: 186-192

Dana Angluin, William I. Gasarch, Carl H. Smith: Training Sequences. Theor. Comput. Sci. 66(3): 255-272 (1989)

Dana Angluin: Equivalence Queries and Approximate Fingerprints. COLT 1989: 134-145

Dana Angluin: Learning With Hints. COLT 1988: 167-181

Dana Angluin: Learning Regular Sets from Queries and Counterexamples. Inf. Comput. 75(2): 87-106 (1987)

Dana Angluin: Queries and Concept Learning. Machine Learning 2(4): 319-342 (1987)

Dana Angluin, Philip D. Laird: Learning From Noisy Examples. Machine Learning 2(4): 343-370 (1987)

Dana Angluin, Douglas N. Hoover: Regular Prefix Relations. Mathematical Systems Theory 17(3): 167-191 (1984)

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

Timothy A. Budd, Dana Angluin: Two Notions of Correctness and Their Relation to Testing. Acta Inf. 18: 31-45 (1982)

Dana Angluin: Inference of Reversible Languages. J. ACM 29(3): 741-765 (1982)

Dana Angluin: A Note on the Number of Queries Needed to Identify Regular Languages. Information and Control 51(1): 76-87 (1981)

Dana Angluin, A. Gardiner: Finite common coverings of pairs of regular graphs. J. Comb. Theory, Ser. B 30(2): 184-187 (1981)

Dana Angluin: Inductive Inference of Formal Languages from Positive Data. Information and Control 45(2): 117-135 (1980)

Dana Angluin: Finding Patterns Common to a Set of Strings. J. Comput. Syst. Sci. 21(1): 46-62 (1980)

Dana Angluin: On Relativizing Auxiliary Pushdown Machines. Mathematical Systems Theory 13: 283-299 (1980)

Dana Angluin: On Counting Problems and the Polynomial-Time Hierarchy. Theor. Comput. Sci. 12: 161-173 (1980)

Dana Angluin: Local and Global Properties in Networks of Processors (Extended Abstract). STOC 1980: 82-93

Dana Angluin: A Note on a Construction of Margulis. Inf. Process. Lett. 8(1): 17-19 (1979)

Dana Angluin, Leslie G. Valiant: Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. J. Comput. Syst. Sci. 18(2): 155-193 (1979)

Dana Angluin: Finding Patterns Common to a Set of Strings (Extended Abstract). STOC 1979: 130-141

Dana Angluin: On the Complexity of Minimum Inference of Regular Sets. Information and Control 39(3): 337-350 (1978)

Dana Angluin, Leslie G. Valiant: Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. STOC 1977: 30-41