Travelled to:1 × Canada
1 × Spain
7 × USA
Collaborated with:∅ T.Antonopoulos D.Fisman J.Aspnes M.Kharitonov L.G.Valiant R.B.Vargas J.Westbrook W.Zhu J.Chen Y.Wu A.Abouzied C.H.Papadimitriou J.M.Hellerstein A.Silberschatz
Talks about:queri (5) learn (4) membership (2) polynomi (2) circuit (2) bibliographi (1) probabilist (1) hamiltonian (1) processor (1) algorithm (1)
Person: Dana Angluin
DBLP: Angluin:Dana
Contributed to:
2013
2011
2006199619921991198019791977
20172020Wrote 11 papers:
- PODS-2013-AbouziedAPHS #learning #quantifier #query #verification
- Learning and verifying quantified boolean queries by example (AA, DA, CHP, JMH, AS), pp. 49–60.
- LATA-2011-AngluinAV
- Mutation Systems (DA, JA, RBV), pp. 92–104.
- STOC-2006-AngluinACW #injection #learning
- Learning a circuit by injecting values (DA, JA, JC, YW), pp. 584–593.
- STOC-1996-AngluinWZ #navigation #query
- Robot Navigation with Range Queries (DA, JW, WZ), pp. 469–478.
- STOC-1992-Angluin #learning #overview
- Computational Learning Theory: Survey and Selected Bibliography (DA), pp. 351–369.
- STOC-1991-AngluinK #query #question
- When Won’t Membership Queries Help? (DA, MK), pp. 444–454.
- STOC-1980-Angluin #network
- Local and Global Properties in Networks of Processors (DA), pp. 82–93.
- STOC-1979-Angluin #set #string
- Finding Patterns Common to a Set of Strings (DA), pp. 130–141.
- STOC-1977-AngluinV #algorithm #performance #probability
- Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings (DA, LGV), pp. 30–41.
- CSL-2017-AngluinAF #learning #polynomial #query
- Query Learning of Derived Omega-Tree Languages in Polynomial Time (DA, TA, DF), p. 21.
- CSL-2020-AngluinAF #ambiguity #automaton #predict #query
- Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries (DA, TA, DF), p. 17.