Dana Angluin - RankMe

126 papers A* 25A 2B 20C 2Journal 70Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Simulating Hard Attention Using Soft Attention. Trans. Assoc. Comput. Linguistics Andy Yang, Lena Strobl, David Chiang, Dana Angluin
2025	J	`jnl`	Concise One-Layer Transformers Can Do Function Evaluation (Sometimes). CoRR Lena Strobl, Dana Angluin, Robert Frank
2025	J	`jnl`	Transformers as Transducers. Trans. Assoc. Comput. Linguistics Lena Strobl, Dana Angluin, David Chiang, Jonathan Rawski, Ashish Sabharwal
2024	J	`jnl`	Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages. Log. Methods Comput. Sci. Dana Angluin, Dana Fisman
2024	A*	`conf`	Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages. NeurIPS Andy Yang, David Chiang, Dana Angluin
2024	J	`jnl`	Simulating Hard Attention Using Soft Attention. CoRR Andy Yang, Lena Strobl, David Chiang, Dana Angluin
2024	J	`jnl`	Transformers as Transducers. CoRR Lena Strobl, Dana Angluin, David Chiang, Jonathan Rawski, Ashish Sabharwal
2024	J	`jnl`	What Formal Languages Can Transformers Express? A Survey. Trans. Assoc. Comput. Linguistics Lena Strobl, William Merrill, Gail Weiss, David Chiang, Dana Angluin
2023	—	`conf`	Learning of Regular Languages by Recurrent Neural Networks? (Mainly Questions). ICGI Dana Angluin
2023	J	`jnl`	Masked Hard-Attention Transformers and Boolean RASP Recognize Exactly the Star-Free Languages. CoRR Dana Angluin, David Chiang, Andy Yang
2023	J	`jnl`	Transformers as Recognizers of Formal Languages: A Survey on Expressivity. CoRR Lena Strobl, William Merrill, Gail Weiss, David Chiang, Dana Angluin
2022	J	`jnl`	Formal Language Recognition by Hard Attention Transformers: Perspectives from Circuit Complexity. CoRR Yiding Hao, Dana Angluin, Robert Frank
2022	J	`jnl`	Formal Language Recognition by Hard Attention Transformers: Perspectives from Circuit Complexity. Trans. Assoc. Comput. Linguistics Yiding Hao, Dana Angluin, Robert Frank
2022	J	`jnl`	Polynomial Identification of omega-Automata. CoRR Dana Angluin, Dana Fisman, Yaara Shoval
2022	B	`conf`	Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. FoSSaCS Dana Angluin, Timos Antonopoulos, Dana Fisman, Nevin George
2021	J	`jnl`	Regular Inf. Comput. Dana Angluin, Dana Fisman
2020	—	`conf`	Polynomial Identification of ømega-Automata. TACAS (2) Dana Angluin, Dana Fisman, Yaara Shoval
2020	J	`jnl`	Polynomial time algorithms for inclusion and equivalence of deterministic omega acceptors. CoRR Dana Angluin, Dana Fisman
2020	B	`conf`	Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries. CSL Dana Angluin, Timos Antonopoulos, Dana Fisman
2020	J	`jnl`	The power of random counterexamples. Theor. Comput. Sci. Dana Angluin, Tyler Dohrn
2019	J	`jnl`	Query learning of derived ωω\omega-tree languages in polynomial time. Log. Methods Comput. Sci. Dana Angluin, Timos Antonopoulos, Dana Fisman
2018	—	`conf`	Context-Free Transductions with Neural Stacks. BlackboxNLP@EMNLP Yiding Hao, William Merrill, Dana Angluin, Robert Frank, Noah Amsel, Andrew Benz, Simon Mendelsohn
2018	J	`jnl`	Context-Free Transductions with Neural Stacks. CoRR Yiding Hao, William Merrill, Dana Angluin, Robert Frank, Noah Amsel, Andrew Benz, Simon Mendelsohn
2018	J	`jnl`	Families of DFAs as Acceptors of ω-Regular Languages. Log. Methods Comput. Sci. Dana Angluin, Udi Boker, Dana Fisman
2018	J	`jnl`	Query learning of derived ω-tree languages in polynomial time. CoRR Dana Angluin, Timos Antonopoulos, Dana Fisman
2018	—	`conf`	Regular omega-Languages with an Informative Right Congruence. GandALF Dana Angluin, Dana Fisman
2017	J	`jnl`	A model of language learning with semantics and meaning-preserving corrections. Artif. Intell. Dana Angluin, Leonor Becerra-Bonache
2017	B	`conf`	Query Learning of Derived Omega-Tree Languages in Polynomial Time. CSL Dana Angluin, Timos Antonopoulos, Dana Fisman
2017	B	`conf`	The Power of Random Counterexamples. ALT Dana Angluin, Tyler Dohrn
2016	J	`jnl`	Families of DFAs as Acceptors of $ω$-Regular Languages. CoRR Dana Angluin, Udi Boker, Dana Fisman
2016	B	`conf`	Families of DFAs as Acceptors of omega-Regular Languages. MFCS Dana Angluin, Udi Boker, Dana Fisman
2016	J	`jnl`	Learning regular omega languages. Theor. Comput. Sci. Dana Angluin, Dana Fisman
2015	A*	`conf`	Learning Regular Languages via Alternating Automata. IJCAI Dana Angluin, Sarah Eisenstat, Dana Fisman
2015	B	`conf`	Learning a Random DFA from Uniform Strings and State Information. ALT Dana Angluin, Dongqu Chen
2015	J	`jnl`	Network construction with subgraph connectivity constraints. J. Comb. Optim. Dana Angluin, James Aspnes, Lev Reyzin
2014	J	`jnl`	Effective storage capacity of labeled graphs. Inf. Comput. Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
2014	B	`conf`	Learning Regular Omega Languages. ALT Dana Angluin, Dana Fisman
2013	J	`jnl`	Learning and Verifying Quantified Boolean Queries by Example CoRR Azza Abouzied, Dana Angluin, Christos H. Papadimitriou, Joseph M. Hellerstein, Avi Silberschatz
2013	A*	`conf`	Learning and verifying quantified boolean queries by example. PODS Azza Abouzied, Dana Angluin, Christos H. Papadimitriou, Joseph M. Hellerstein, Avi Silberschatz
2013	J	`jnl`	Mutation systems. Int. J. Comput. Math. Dana Angluin, James Aspnes, Raonne Barbosa Vargas
2013	J	`jnl`	On the learnability of shuffle ideals. J. Mach. Learn. Res. Dana Angluin, James Aspnes, Sarah Eisenstat, Aryeh Kontorovich
2012	B	`conf`	On the Learnability of Shuffle Ideals. ALT Dana Angluin, James Aspnes, Aryeh Kontorovich
2011	—	`conf`	An Overview of How Semantics and Corrections Can Help Language Learning. Web Intelligence/IAT Workshops Dana Angluin, Leonor Becerra-Bonache
2011	B	`conf`	Effects of Meaning-Preserving Corrections on Language Learning. CoNLL Dana Angluin, Leonor Becerra-Bonache
2011	C	`conf`	Mutation Systems. LATA Dana Angluin, James Aspnes, Raonne Barbosa Vargas
2010	B	`conf`	Inferring Social Networks from Outbreaks. ALT Dana Angluin, James Aspnes, Lev Reyzin
2010	B	`conf`	Lower Bounds on Learning Random Structures with Statistical Queries. ALT Dana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin
2010	J	`jnl`	Optimally learning social networks with activations and suppressions. Theor. Comput. Sci. Dana Angluin, James Aspnes, Lev Reyzin
2010	C	`conf`	Storage Capacity of Labeled Graphs. SSS Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
2009	J	`jnl`	Learning Acyclic Probabilistic Circuits Using Test Paths. J. Mach. Learn. Res. Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin
2009	B	`conf`	Learning Finite Automata Using Label Queries. ALT Dana Angluin, Leonor Becerra-Bonache, Adrian-Horia Dediu, Lev Reyzin
2009	J	`jnl`	Learning a circuit by injecting values. J. Comput. Syst. Sci. Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu
2008	J	`jnl`	A simple population protocol for fast robust approximate majority. Distributed Comput. Dana Angluin, James Aspnes, David Eisenstat
2008	J	`jnl`	Fast computation by population protocols with a leader. Distributed Comput. Dana Angluin, James Aspnes, David Eisenstat
2008	A*	`conf`	Learning Acyclic Probabilistic Circuits Using Test Paths. COLT Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin
2008	—	`conf`	Learning Meaning Before Syntax. ICGI Dana Angluin, Leonor Becerra-Bonache
2008	J	`jnl`	Learning a hidden graph using O(logn) queries per edge. J. Comput. Syst. Sci. Dana Angluin, Jiang Chen
2008	J	`jnl`	Learning large-alphabet and analog circuits with value injection queries. Mach. Learn. Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
2008	B	`conf`	Optimally Learning Social Networks with Activations and Suppressions. ALT Dana Angluin, James Aspnes, Lev Reyzin
2008	J	`jnl`	Self-stabilizing population protocols. ACM Trans. Auton. Adapt. Syst. Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
2007	A	`conf`	A Simple Population Protocol for Fast Robust Approximate Majority. DISC Dana Angluin, James Aspnes, David Eisenstat
2007	A*	`conf`	Learning Large-Alphabet and Analog Circuits with Value Injection Queries. COLT Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
2007	J	`jnl`	The VC dimension of k-fold union. Inf. Process. Lett. David Eisenstat, Dana Angluin
2007	J	`jnl`	The computational power of population protocols. Distributed Comput. Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
2006	J	`jnl`	Computation in networks of passively mobile finite-state sensors. Distributed Comput. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
2006	A	`conf`	Fast Computation by Population Protocols with a Leader. DISC Dana Angluin, James Aspnes, David Eisenstat
2006	J	`jnl`	Learning a Hidden Hypergraph. J. Mach. Learn. Res. Dana Angluin, Jiang Chen
2006	A*	`conf`	Learning a circuit by injecting values. STOC Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu
2006	B	`conf`	Stabilizing Consensus in Mobile Networks. DCOSS Dana Angluin, Michael J. Fischer, Hong Jiang
2006	A*	`conf`	Stably computable predicates are semilinear. PODC Dana Angluin, James Aspnes, David Eisenstat
2006	J	`jnl`	The computational power of population protocols CoRR Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
2005	B	`conf`	Fast construction of overlay networks. SPAA Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin
2005	A*	`conf`	Learning a Hidden Hypergraph. COLT Dana Angluin, Jiang Chen
2005	B	`conf`	On the Power of Anonymous One-Way Communication. OPODIS Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
2005	B	`conf`	Self-stabilizing Population Protocols. OPODIS Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
2005	B	`conf`	Stably Computable Properties of Network Graphs. DCOSS Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta
2004	A*	`conf`	Computation in networks of passively mobile finite-state sensors. PODC Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
2004	A*	`conf`	Learning a Hidden Graph Using O(log n) Queries Per Edge. COLT Dana Angluin, Jiang Chen
2004	—	`conf`	Learning and Mathematics. ICGI Dana Angluin
2004	J	`jnl`	Queries revisited. Theor. Comput. Sci. Dana Angluin
2003	J	`jnl`	Learning from Different Teachers. Mach. Learn. Dana Angluin, Martins Krikis
2001	B	`conf`	Queries Revisited. ALT Dana Angluin
2001	B	`conf`	Queries Revisited. Discovery Science Dana Angluin
2001	J	`jnl`	Robot localization in a grid. Inf. Process. Lett. Chinda Wongngamnit, Dana Angluin
2000	J	`jnl`	Robot Navigation with Distance Queries. SIAM J. Comput. Dana Angluin, Jeffery R. Westbrook, Wenhong Zhu
1997	A*	`conf`	Learning Markov Chains with Variable Memory Length from Noisy Output. COLT Dana Angluin, Miklós Csürös
1997	J	`jnl`	Malicious Omissions and Errors in Answers to Membership Queries. Mach. Learn. Dana Angluin, Martins Krikis, Robert H. Sloan, György Turán
1997	A*	`conf`	Teachers, Learners and Black Boxes. COLT Dana Angluin, Martins Krikis
1996	J	`jnl`	A 1996 Snapshot of Computational Learning Theory. ACM Comput. Surv. Dana Angluin
1996	A*	`conf`	Robot Navigation with Range Queries. STOC Dana Angluin, Jeffery R. Westbrook, Wenhong Zhu
1995	J	`jnl`	Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning. Mach. Learn. Thomas L. Dean, Dana Angluin, Kenneth Basye, Sean P. Engelson, Leslie Pack Kaelbling, Evangelos Kokkevis, Oded Maron
1995	J	`jnl`	When Won't Membership Queries Help? J. Comput. Syst. Sci. Dana Angluin, Michael Kharitonov
1994	A*	`conf`	Learning with Malicious Membership Queries and Exceptions (Extended Abstract). COLT Dana Angluin, Martins Krikis
1994	J	`jnl`	Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle. Mach. Learn. Dana Angluin, Donna K. Slonim
1993	J	`jnl`	Learning Read-Once Formulas with Queries. J. ACM Dana Angluin, Lisa Hellerstein, Marek Karpinski
1992	A*	`conf`	Computational Learning Theory: Survey and Selected Bibliography STOC Dana Angluin
1992	A*	`conf`	Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning. AAAI Thomas L. Dean, Dana Angluin, Kenneth Basye, Sean P. Engelson, Leslie Pack Kaelbling, Evangelos Kokkevis, Oded Maron
1992	J	`jnl`	Learning Conjunctions of Horn Clauses. Mach. Learn. Dana Angluin, Michael Frazier, Leonard Pitt
1991	A*	`conf`	Learning Monotone DNF with an Incomplete Membership Oracle. COLT Dana Angluin, Donna K. Slonim
1991	A*	`conf`	When Won't Membership Queries Help? (Extended Abstract) STOC Dana Angluin, Michael Kharitonov
1990	A*	`conf`	Learning Conjunctions of Horn Clauses (Abstract). COLT Dana Angluin, Michael Frazier, Leonard Pitt
1990	A*	`conf`	Learning Conjunctions of Horn Clauses (Extended Abstract) FOCS Dana Angluin, Michael Frazier, Leonard Pitt
1990	J	`jnl`	Negative Results for Equivalence Queries. Mach. Learn. Dana Angluin
1989	A*	`conf`	Equivalence Queries and Approximate Fingerprints. COLT Dana Angluin
1989	J	`jnl`	Training Sequences. Theor. Comput. Sci. Dana Angluin, William I. Gasarch, Carl H. Smith
1988	A*	`conf`	Learning With Hints. COLT Dana Angluin
1987	J	`jnl`	Learning From Noisy Examples. Mach. Learn. Dana Angluin, Philip D. Laird
1987	J	`jnl`	Learning Regular Sets from Queries and Counterexamples Inf. Comput. Dana Angluin
1987	J	`jnl`	Queries and Concept Learning. Mach. Learn. Dana Angluin
1984	J	`jnl`	Regular Prefix Relations. Math. Syst. Theory Dana Angluin, Douglas N. Hoover
1983	J	`jnl`	Inductive Inference: Theory and Methods. ACM Comput. Surv. Dana Angluin, Carl H. Smith
1982	J	`jnl`	Inference of Reversible Languages. J. ACM Dana Angluin
1982	J	`jnl`	Two Notions of Correctness and Their Relation to Testing. Acta Informatica Timothy A. Budd, Dana Angluin
1981	J	`jnl`	A Note on the Number of Queries Needed to Identify Regular Languages Inf. Control. Dana Angluin
1981	J	`jnl`	Finite common coverings of pairs of regular graphs. J. Comb. Theory B Dana Angluin, A. Gardiner
1980	J	`jnl`	Finding Patterns Common to a Set of Strings. J. Comput. Syst. Sci. Dana Angluin
1980	J	`jnl`	Inductive Inference of Formal Languages from Positive Data Inf. Control. Dana Angluin
1980	A*	`conf`	Local and Global Properties in Networks of Processors (Extended Abstract) STOC Dana Angluin
1980	J	`jnl`	On Counting Problems and the Polynomial-Time Hierarchy. Theor. Comput. Sci. Dana Angluin
1980	J	`jnl`	On Relativizing Auxiliary Pushdown Machines. Math. Syst. Theory Dana Angluin
1979	J	`jnl`	A Note on a Construction of Margulis. Inf. Process. Lett. Dana Angluin
1979	J	`jnl`	Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. J. Comput. Syst. Sci. Dana Angluin, Leslie G. Valiant
1979	A*	`conf`	Finding Patterns Common to a Set of Strings (Extended Abstract) STOC Dana Angluin
1978	J	`jnl`	On the Complexity of Minimum Inference of Regular Sets Inf. Control. Dana Angluin
1977	A*	`conf`	Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings STOC Dana Angluin, Leslie G. Valiant
1976	J	`jnl`	The four Russians' algorithm for boolean matrix multiplication is optimal in its class. SIGACT News Dana Angluin