The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dana Angluin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  65. Learning Finite Automata Using Label Queries. [Citation Graph (, )][DBLP]


  66. Optimally Learning Social Networks with Activations and Suppressions. [Citation Graph (, )][DBLP]


  67. Inferring Social Networks from Outbreaks. [Citation Graph (, )][DBLP]


  68. Lower Bounds on Learning Random Structures with Statistical Queries. [Citation Graph (, )][DBLP]


  69. Learning Acyclic Probabilistic Circuits Using Test Paths. [Citation Graph (, )][DBLP]


  70. Learning Meaning Before Syntax. [Citation Graph (, )][DBLP]


  71. Storage Capacity of Labeled Graphs. [Citation Graph (, )][DBLP]


  72. The computational power of population protocols. [Citation Graph (, )][DBLP]


  73. A simple population protocol for fast robust approximate majority. [Citation Graph (, )][DBLP]


  74. Fast computation by population protocols with a leader. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002