| 2009 |
|---|
| 74 | EE | Dana Angluin,
James Aspnes,
Jiang Chen,
Yinghua Wu:
Learning a circuit by injecting values.
J. Comput. Syst. Sci. 75(1): 60-77 (2009) |
| 2008 |
|---|
| 73 | EE | Dana Angluin,
James Aspnes,
Lev Reyzin:
Optimally Learning Social Networks with Activations and Suppressions.
ALT 2008: 272-286 |
| 72 | EE | Dana Angluin,
James Aspnes,
Jiang Chen,
David Eisenstat,
Lev Reyzin:
Learning Acyclic Probabilistic Circuits Using Test Paths.
COLT 2008: 169-180 |
| 71 | EE | Dana Angluin,
Leonor Becerra-Bonache:
Learning Meaning Before Syntax.
ICGI 2008: 1-14 |
| 70 | EE | Dana Angluin,
James Aspnes,
David Eisenstat:
A simple population protocol for fast robust approximate majority.
Distributed Computing 21(2): 87-102 (2008) |
| 69 | EE | Dana Angluin,
James Aspnes,
David Eisenstat:
Fast computation by population protocols with a leader.
Distributed Computing 21(3): 183-199 (2008) |
| 68 | EE | Dana Angluin,
Jiang Chen:
Learning a hidden graph using O(logn) queries per edge.
J. Comput. Syst. Sci. 74(4): 546-556 (2008) |
| 67 | EE | 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) |
| 66 | EE | Dana Angluin,
James Aspnes,
Michael J. Fischer,
Hong Jiang:
Self-stabilizing population protocols.
TAAS 3(4): (2008) |
| 2007 |
|---|
| 65 | EE | Dana Angluin,
James Aspnes,
Jiang Chen,
Lev Reyzin:
Learning Large-Alphabet and Analog Circuits with Value Injection Queries.
COLT 2007: 51-65 |
| 64 | EE | Dana Angluin,
James Aspnes,
David Eisenstat:
A Simple Population Protocol for Fast Robust Approximate Majority.
DISC 2007: 20-32 |
| 63 | EE | Dana Angluin,
James Aspnes,
David Eisenstat,
Eric Ruppert:
The computational power of population protocols.
Distributed Computing 20(4): 279-304 (2007) |
| 62 | EE | David Eisenstat,
Dana Angluin:
The VC dimension of k-fold union.
Inf. Process. Lett. 101(5): 181-184 (2007) |
| 2006 |
|---|
| 61 | EE | Dana Angluin,
Michael J. Fischer,
Hong Jiang:
Stabilizing Consensus in Mobile Networks.
DCOSS 2006: 37-50 |
| 60 | EE | Dana Angluin,
James Aspnes,
David Eisenstat:
Fast Computation by Population Protocols with a Leader.
DISC 2006: 61-75 |
| 59 | EE | Dana Angluin,
James Aspnes,
David Eisenstat:
Stably computable predicates are semilinear.
PODC 2006: 292-299 |
| 58 | EE | Dana Angluin,
James Aspnes,
Jiang Chen,
Yinghua Wu:
Learning a circuit by injecting values.
STOC 2006: 584-593 |
| 57 | EE | Dana Angluin,
James Aspnes,
David Eisenstat,
Eric Ruppert:
The computational power of population protocols
CoRR abs/cs/0608084: (2006) |
| 56 | EE | 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) |
| 55 | EE | Dana Angluin,
Jiang Chen:
Learning a Hidden Hypergraph.
Journal of Machine Learning Research 7: 2215-2236 (2006) |
| 2005 |
|---|
| 54 | EE | Dana Angluin,
Jiang Chen:
Learning a Hidden Hypergraph.
COLT 2005: 561-575 |
| 53 | EE | Dana Angluin,
James Aspnes,
Melody Chan,
Michael J. Fischer,
Hong Jiang,
René Peralta:
Stably Computable Properties of Network Graphs.
DCOSS 2005: 63-74 |
| 52 | EE | Dana Angluin,
James Aspnes,
Michael J. Fischer,
Hong Jiang:
Self-stabilizing Population Protocols.
OPODIS 2005: 103-117 |
| 51 | EE | Dana Angluin,
James Aspnes,
David Eisenstat,
Eric Ruppert:
On the Power of Anonymous One-Way Communication.
OPODIS 2005: 396-411 |
| 50 | EE | Dana Angluin,
James Aspnes,
Jiang Chen,
Yinghua Wu,
Yitong Yin:
Fast construction of overlay networks.
SPAA 2005: 145-154 |
| 2004 |
|---|
| 49 | EE | Dana Angluin,
Jiang Chen:
Learning a Hidden Graph Using O(log n) Queries Per Edge.
COLT 2004: 210-223 |
| 48 | EE | Dana Angluin:
Learning and Mathematics.
ICGI 2004: 1-2 |
| 47 | EE | Dana Angluin,
James Aspnes,
Zoë Diamadi,
Michael J. Fischer,
René Peralta:
Computation in networks of passively mobile finite-state sensors.
PODC 2004: 290-299 |
| 46 | EE | Dana Angluin:
Queries revisited.
Theor. Comput. Sci. 313(2): 175-194 (2004) |
| 2003 |
|---|
| 45 | EE | Dana Angluin,
Martins Krikis:
Learning from Different Teachers.
Machine Learning 51(2): 137-163 (2003) |
| 2001 |
|---|
| 44 | EE | Dana Angluin:
Queries Revisited.
ALT 2001: 12-31 |
| 43 | EE | Dana Angluin:
Queries Revisited.
Discovery Science 2001: 16 |
| 42 | EE | Chinda Wongngamnit,
Dana Angluin:
Robot localization in a grid.
Inf. Process. Lett. 77(5-6): 261-267 (2001) |
| 2000 |
|---|
| 41 | | Dana Angluin,
Jeffery Westbrook,
Wenhong Zhu:
Robot Navigation with Distance Queries.
SIAM J. Comput. 30(1): 110-144 (2000) |
| 1997 |
|---|
| 40 | EE | Dana Angluin,
Martins Krikis:
Teachers, Learners and Black Boxes.
COLT 1997: 285-297 |
| 39 | EE | Dana Angluin,
Miklós Csürös:
Learning Markov Chains with Variable Memory Length from Noisy Output.
COLT 1997: 298-308 |
| 38 | | 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) |
| 1996 |
|---|
| 37 | EE | Dana Angluin,
Jeffery Westbrook,
Wenhong Zhu:
Robot Navigation with Range Queries.
STOC 1996: 469-478 |
| 36 | | Dana Angluin:
A 1996 Snapshot of Computational Learning Theory.
ACM Comput. Surv. 28(4es): 216 (1996) |
| 1995 |
|---|
| 35 | | Dana Angluin,
Michael Kharitonov:
When Won't Membership Queries Help?
J. Comput. Syst. Sci. 50(2): 336-355 (1995) |
| 34 | | Thomas 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) |
| 1994 |
|---|
| 33 | EE | Dana Angluin,
Martins Krikis:
Learning with Malicious Membership Queries and Exceptions (Extended Abstract).
COLT 1994: 57-66 |
| 32 | | Dana Angluin,
Donna K. Slonim:
Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle.
Machine Learning 14(1): 7-26 (1994) |
| 1993 |
|---|
| 31 | EE | Dana Angluin,
Lisa Hellerstein,
Marek Karpinski:
Learning Read-Once Formulas with Queries.
J. ACM 40(1): 185-210 (1993) |
| 1992 |
|---|
| 30 | | Thomas 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 |
| 29 | | Dana Angluin:
Computational Learning Theory: Survey and Selected Bibliography
STOC 1992: 351-369 |
| 28 | | Dana Angluin,
Michael Frazier,
Leonard Pitt:
Learning Conjunctions of Horn Clauses.
Machine Learning 9: 147-164 (1992) |
| 1991 |
|---|
| 27 | EE | Dana Angluin,
Donna K. Slonim:
Learning Monotone DNF with an Incomplete Membership Oracle.
COLT 1991: 139-146 |
| 26 | | Dana Angluin,
Michael Kharitonov:
When Won't Membership Queries Help? (Extended Abstract)
STOC 1991: 444-454 |
| 1990 |
|---|
| 25 | EE | Dana Angluin,
Michael Frazier,
Leonard Pitt:
Learning Conjunctions of Horn Clauses (Abstract).
COLT 1990: 387 |
| 24 | | Dana Angluin,
Michael Frazier,
Leonard Pitt:
Learning Conjunctions of Horn Clauses (Extended Abstract)
FOCS 1990: 186-192 |
| 23 | | Dana Angluin:
Negative Results for Equivalence Queries.
Machine Learning 5: 121-150 (1990) |
| 1989 |
|---|
| 22 | EE | Dana Angluin:
Equivalence Queries and Approximate Fingerprints.
COLT 1989: 134-145 |
| 21 | | Dana Angluin,
William I. Gasarch,
Carl H. Smith:
Training Sequences.
Theor. Comput. Sci. 66(3): 255-272 (1989) |
| 1988 |
|---|
| 20 | EE | Dana Angluin:
Learning With Hints.
COLT 1988: 167-181 |
| 1987 |
|---|
| 19 | | Dana Angluin:
Learning Regular Sets from Queries and Counterexamples
Inf. Comput. 75(2): 87-106 (1987) |
| 18 | | Dana Angluin:
Queries and Concept Learning.
Machine Learning 2(4): 319-342 (1987) |
| 17 | | Dana Angluin,
Philip D. Laird:
Learning From Noisy Examples.
Machine Learning 2(4): 343-370 (1987) |
| 1984 |
|---|
| 16 | | Dana Angluin,
Douglas N. Hoover:
Regular Prefix Relations.
Mathematical Systems Theory 17(3): 167-191 (1984) |
| 1983 |
|---|
| 15 | | Dana Angluin,
Carl H. Smith:
Inductive Inference: Theory and Methods.
ACM Comput. Surv. 15(3): 237-269 (1983) |
| 1982 |
|---|
| 14 | | Timothy A. Budd,
Dana Angluin:
Two Notions of Correctness and Their Relation to Testing.
Acta Inf. 18: 31-45 (1982) |
| 13 | EE | Dana Angluin:
Inference of Reversible Languages.
J. ACM 29(3): 741-765 (1982) |
| 1981 |
|---|
| 12 | | Dana Angluin:
A Note on the Number of Queries Needed to Identify Regular Languages
Information and Control 51(1): 76-87 (1981) |
| 11 | EE | Dana Angluin,
A. Gardiner:
Finite common coverings of pairs of regular graphs.
J. Comb. Theory, Ser. B 30(2): 184-187 (1981) |
| 1980 |
|---|
| 10 | | Dana Angluin:
Local and Global Properties in Networks of Processors (Extended Abstract)
STOC 1980: 82-93 |
| 9 | | Dana Angluin:
Inductive Inference of Formal Languages from Positive Data
Information and Control 45(2): 117-135 (1980) |
| 8 | | Dana Angluin:
Finding Patterns Common to a Set of Strings.
J. Comput. Syst. Sci. 21(1): 46-62 (1980) |
| 7 | | Dana Angluin:
On Relativizing Auxiliary Pushdown Machines.
Mathematical Systems Theory 13: 283-299 (1980) |
| 6 | | Dana Angluin:
On Counting Problems and the Polynomial-Time Hierarchy.
Theor. Comput. Sci. 12: 161-173 (1980) |
| 1979 |
|---|
| 5 | | Dana Angluin:
Finding Patterns Common to a Set of Strings (Extended Abstract)
STOC 1979: 130-141 |
| 4 | | Dana Angluin:
A Note on a Construction of Margulis.
Inf. Process. Lett. 8(1): 17-19 (1979) |
| 3 | | Dana Angluin,
Leslie G. Valiant:
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings.
J. Comput. Syst. Sci. 18(2): 155-193 (1979) |
| 1978 |
|---|
| 2 | | Dana Angluin:
On the Complexity of Minimum Inference of Regular Sets
Information and Control 39(3): 337-350 (1978) |
| 1977 |
|---|
| 1 | | Dana Angluin,
Leslie G. Valiant:
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings
STOC 1977: 30-41 |
