Dana Angluin

Yale University

	2011
82		Dana Angluin, James Aspnes, Raonne Barbosa Vargas: Mutation Systems. LATA 2011: 92-104
81		Dana Angluin, Leonor Becerra-Bonache: An Overview of How Semantics and Corrections Can Help Language Learning. Web Intelligence/IAT Workshops 2011: 147-150
	2010
80		Dana Angluin, James Aspnes, Lev Reyzin: Inferring Social Networks from Outbreaks. ALT 2010: 104-118
79		Dana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin: Lower Bounds on Learning Random Structures with Statistical Queries. ALT 2010: 194-208
78		Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod: Storage Capacity of Labeled Graphs. SSS 2010: 573-587
77		Dana Angluin, James Aspnes, Lev Reyzin: Optimally learning social networks with activations and suppressions. Theor. Comput. Sci. 411(29-30): 2729-2740 (2010)
	2009
76		Dana Angluin, Leonor Becerra-Bonache, Adrian Horia Dediu, Lev Reyzin: Learning Finite Automata Using Label Queries. ALT 2009: 171-185
75		Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu: Learning a circuit by injecting values. J. Comput. Syst. Sci. 75(1): 60-77 (2009)
74		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)
	2008
73		Dana Angluin, James Aspnes, Lev Reyzin: Optimally Learning Social Networks with Activations and Suppressions. ALT 2008: 272-286
72		Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin: Learning Acyclic Probabilistic Circuits Using Test Paths. COLT 2008: 169-180
71		Dana Angluin, Leonor Becerra-Bonache: Learning Meaning Before Syntax. ICGI 2008: 1-14
70		Dana Angluin, James Aspnes, David Eisenstat: A simple population protocol for fast robust approximate majority. Distributed Computing 21(2): 87-102 (2008)
69		Dana Angluin, James Aspnes, David Eisenstat: Fast computation by population protocols with a leader. Distributed Computing 21(3): 183-199 (2008)
68		Dana Angluin, Jiang Chen: Learning a hidden graph using O(logn) queries per edge. J. Comput. Syst. Sci. 74(4): 546-556 (2008)
67		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		Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang: Self-stabilizing population protocols. TAAS 3(4): (2008)
	2007
65		Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin: Learning Large-Alphabet and Analog Circuits with Value Injection Queries. COLT 2007: 51-65
64		Dana Angluin, James Aspnes, David Eisenstat: A Simple Population Protocol for Fast Robust Approximate Majority. DISC 2007: 20-32
63		Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: The computational power of population protocols. Distributed Computing 20(4): 279-304 (2007)
62		David Eisenstat, Dana Angluin: The VC dimension of k-fold union. Inf. Process. Lett. 101(5): 181-184 (2007)
	2006
61		Dana Angluin, Michael J. Fischer, Hong Jiang: Stabilizing Consensus in Mobile Networks. DCOSS 2006: 37-50
60		Dana Angluin, James Aspnes, David Eisenstat: Fast Computation by Population Protocols with a Leader. DISC 2006: 61-75
59		Dana Angluin, James Aspnes, David Eisenstat: Stably computable predicates are semilinear. PODC 2006: 292-299
58		Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu: Learning a circuit by injecting values. STOC 2006: 584-593
57		Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: The computational power of population protocols CoRR abs/cs/0608084: (2006)
56		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		Dana Angluin, Jiang Chen: Learning a Hidden Hypergraph. Journal of Machine Learning Research 7: 2215-2236 (2006)
	2005
54		Dana Angluin, Jiang Chen: Learning a Hidden Hypergraph. COLT 2005: 561-575
53		Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta: Stably Computable Properties of Network Graphs. DCOSS 2005: 63-74
52		Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang: Self-stabilizing Population Protocols. OPODIS 2005: 103-117
51		Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: On the Power of Anonymous One-Way Communication. OPODIS 2005: 396-411
50		Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin: Fast construction of overlay networks. SPAA 2005: 145-154
	2004
49		Dana Angluin, Jiang Chen: Learning a Hidden Graph Using O(log n) Queries Per Edge. COLT 2004: 210-223
48		Dana Angluin: Learning and Mathematics. ICGI 2004: 1-2
47		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		Dana Angluin: Queries revisited. Theor. Comput. Sci. 313(2): 175-194 (2004)
	2003
45		Dana Angluin, Martins Krikis: Learning from Different Teachers. Machine Learning 51(2): 137-163 (2003)
	2001
44		Dana Angluin: Queries Revisited. ALT 2001: 12-31
43		Dana Angluin: Queries Revisited. Discovery Science 2001: 16
42		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		Dana Angluin, Martins Krikis: Teachers, Learners and Black Boxes. COLT 1997: 285-297
39		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		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		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		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		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		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		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		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		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		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

Coauthor Index

1	Shlomo Argamon (Shlomo Argamon-Engelson, Sean P. Engelson)	[30] [34]
2	James Aspnes	[47] [50] [51] [52] [53] [56] [57] [58] [59] [60] [63] [64] [65] [66] [67] [69] [70] [72] [73] [74] [75] [77] [78] [80] [82]
3	Kenneth Basye	[30] [34]
4	Rida A. Bazzi	[78]
5	Leonor Becerra-Bonache	[71] [76] [81]
6	Timothy A. Budd	[14]
7	Melody Chan	[53]
8	Jiang Chen	[49] [50] [54] [55] [58] [65] [67] [68] [72] [74] [75] [78]
9	Miklós Csürös	[39]
10	Thomas Dean	[30] [34]
11	Adrian Horia Dediu	[76]
12	Zoë Diamadi	[47] [56]
13	David Eisenstat	[51] [57] [59] [60] [62] [63] [64] [69] [70] [72] [74] [78] [79]
14	Michael J. Fischer	[47] [52] [53] [56] [61] [66]
15	Michael Frazier	[24] [25] [28]
16	A. Gardiner	[11]
17	William I. Gasarch	[21]
18	Lisa Hellerstein	[31]
19	Douglas N. Hoover	[16]
20	Hong Jiang	[52] [53] [61] [66]
21	Leslie Pack Kaelbling	[30] [34]
22	Marek Karpinski	[31]
23	Michael Kharitonov	[26] [35]
24	Evangelos Kokkevis	[30] [34]
25	Goran Konjevod	[78]
26	Leonid Kontorovich	[79]
27	Martins Krikis	[33] [38] [40] [45]
28	Philip D. Laird	[17]
29	Oded Maron	[30] [34]
30	René Peralta	[47] [53] [56]
31	Leonard Pitt	[24] [25] [28]
32	Lev Reyzin	[65] [67] [72] [73] [74] [76] [77] [79] [80]
33	Eric Ruppert	[51] [57] [63]
34	Robert H. Sloan	[38]
35	Donna K. Slonim	[27] [32]
36	Carl H. Smith	[15] [21]
37	György Turán	[38]
38	Leslie G. Valiant	[1] [3]
39	Raonne Barbosa Vargas	[82]
40	Jeffery Westbrook	[37] [41]
41	Chinda Wongngamnit	[42]
42	Yinghua Wu	[50] [58] [75]
43	Yitong Yin	[50]
44	Wenhong Zhu	[37] [41]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page