The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Zeugmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rolf Wiehagen, Thomas Zeugmann
    Too Much Can be Too Much for Learning Efficiently. [Citation Graph (0, 0)][DBLP]
    AII, 1992, pp:72-86 [Conf]
  2. Thomas Zeugmann
    On recursive optimizers. [Citation Graph (0, 0)][DBLP]
    Mathematical Methods of Specification and Synthesis of Software Systems, 1985, pp:240-245 [Conf]
  3. Thomas Zeugmann
    On Barzdin's Conjecture. [Citation Graph (0, 0)][DBLP]
    AII, 1986, pp:220-227 [Conf]
  4. Efim B. Kinber, Thomas Zeugmann
    Refined Query Inference (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    AII, 1989, pp:148-160 [Conf]
  5. Steffen Lange, Thomas Zeugmann
    A Unifying Approach to Monotonic Language Learning on Informant. [Citation Graph (0, 0)][DBLP]
    AII, 1992, pp:244-259 [Conf]
  6. Naoki Abe, Roni Khardon, Thomas Zeugmann
    Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    ALT, 2001, pp:1-8 [Conf]
  7. John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
    Learning a Subclass of Regular Patterns in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    ALT, 2003, pp:234-246 [Conf]
  8. Frank Balbach, Thomas Zeugmann
    Teaching Learners with Restricted Mind Changes. [Citation Graph (0, 0)][DBLP]
    ALT, 2005, pp:474-489 [Conf]
  9. Frank Balbach, Thomas Zeugmann
    Teaching Memoryless Randomized Learners Without Feedback. [Citation Graph (0, 0)][DBLP]
    ALT, 2006, pp:93-108 [Conf]
  10. Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann
    Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:260-276 [Conf]
  11. Gunter Grieser, Steffen Lange, Thomas Zeugmann
    Learning Recursive Concepts with Anomalies. [Citation Graph (0, 0)][DBLP]
    ALT, 2000, pp:101-115 [Conf]
  12. Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann
    Learning Recursive Functions Refutably. [Citation Graph (0, 0)][DBLP]
    ALT, 2001, pp:283-298 [Conf]
  13. Klaus P. Jantke, Takeshi Shinohara, Thomas Zeugmann
    Editor's Introduction. [Citation Graph (0, 0)][DBLP]
    ALT, 1995, pp:0-0 [Conf]
  14. Steffen Lange, Rolf Wiehagen, Thomas Zeugmann
    Learning by Erasing. [Citation Graph (0, 0)][DBLP]
    ALT, 1996, pp:228-241 [Conf]
  15. Steffen Lange, Thomas Zeugmann
    Set-Driven and Rearrangement-Independent Learning of Recursive Languages. [Citation Graph (0, 0)][DBLP]
    AII/ALT, 1994, pp:453-468 [Conf]
  16. Frank Stephan, Thomas Zeugmann
    On the Uniform Learnability of Approximations to Non-Recursive Functions. [Citation Graph (0, 0)][DBLP]
    ATL, 1999, pp:276-290 [Conf]
  17. Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann
    Editor's Introduction. [Citation Graph (0, 0)][DBLP]
    ALT, 1998, pp:1-10 [Conf]
  18. Thomas Zeugmann
    Can Learning in the Limit Be Done Efficiently? [Citation Graph (0, 0)][DBLP]
    ALT, 2003, pp:17-38 [Conf]
  19. Thomas Zeugmann
    Average Case Analysis of Pattern Language Learning Algorithms (Abstract). [Citation Graph (0, 0)][DBLP]
    AII/ALT, 1994, pp:8-9 [Conf]
  20. Frank Balbach, Thomas Zeugmann
    Teaching Randomized Learners. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:229-243 [Conf]
  21. Efim B. Kinber, William I. Gasarch, Thomas Zeugmann, Mark G. Pleszkoch, Carl H. Smith
    Learning Via Queries With Teams and Anomilies. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:327-337 [Conf]
  22. Steffen Lange, Thomas Zeugmann
    Types of Monotonic Language Learning and Their Characterization. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:377-390 [Conf]
  23. Steffen Lange, Thomas Zeugmann
    Language Learning in Dependence on the Space of Hypotheses. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:127-136 [Conf]
  24. Rüdiger Reischuk, Thomas Zeugmann
    Learning One-Variable Pattern Languages in Linear Average Time. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:198-208 [Conf]
  25. Frank Stephan, Thomas Zeugmann
    Average-Case Complexity of Learning Polynomials. [Citation Graph (0, 0)][DBLP]
    COLT, 2000, pp:59-68 [Conf]
  26. Jan Poland, Thomas Zeugmann
    Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2006, pp:197-208 [Conf]
  27. Thomas Zeugmann
    Can Learning in the Limit Be Done Efficiently? [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2003, pp:46- [Conf]
  28. Rusins Freivalds, Thomas Zeugmann
    Co-Learning of Recursive Languages from Positive Data. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 1996, pp:122-133 [Conf]
  29. Steffen Lange, Thomas Zeugmann
    Trading monotonicity demands versus mind changes. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1995, pp:125-139 [Conf]
  30. Efim B. Kinber, Thomas Zeugmann
    Monte-Carlo Inference and Its Relations to Reliable Frequency Identification. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:257-266 [Conf]
  31. Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann
    Classifying Recursive Predicates and Languages. [Citation Graph (0, 0)][DBLP]
    GOSLER Final Report, 1995, pp:174-189 [Conf]
  32. Rolf Wiehagen, Thomas Zeugmann
    Learning and Consistency. [Citation Graph (0, 0)][DBLP]
    GOSLER Final Report, 1995, pp:1-24 [Conf]
  33. Thomas Zeugmann, Steffen Lange
    A Guided Tour Across the Boundaries of Learning Recursive Languages. [Citation Graph (0, 0)][DBLP]
    GOSLER Final Report, 1995, pp:190-258 [Conf]
  34. Peter Rossmanith, Thomas Zeugmann
    Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data. [Citation Graph (0, 0)][DBLP]
    ICGI, 1998, pp:13-24 [Conf]
  35. Yohji Akama, Thomas Zeugmann
    Consistency Conditions for Inductive Inference of Recursive Functions. [Citation Graph (0, 0)][DBLP]
    JSAI, 2006, pp:251-264 [Conf]
  36. Ryutaro Kurai, Shin-ichi Minato, Thomas Zeugmann
    N-Gram Analysis Based on Zero-Suppressed BDDs. [Citation Graph (0, 0)][DBLP]
    JSAI, 2006, pp:289-300 [Conf]
  37. Thomas Zeugmann
    Computing Large Polynomial Powers Very Fast in Parallel. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:538-544 [Conf]
  38. Steffen Lange, Thomas Zeugmann
    Monotonic Versus Nonmonotonic Language Learning. [Citation Graph (0, 0)][DBLP]
    Nonmonotonic and Inductive Logic, 1991, pp:254-269 [Conf]
  39. Thomas Zeugmann
    Inductive Inference of Optimal Programs: A Survey and Open Problems. [Citation Graph (0, 0)][DBLP]
    Nonmonotonic and Inductive Logic, 1990, pp:208-222 [Conf]
  40. Thomas Zeugmann
    Stochastic Finite Learning. [Citation Graph (0, 0)][DBLP]
    SAGA, 2001, pp:155-172 [Conf]
  41. Steffen Lange, Thomas Zeugmann
    Language Learning with a Bounded Number of Mind Changes. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:682-691 [Conf]
  42. Rüdiger Reischuk, Thomas Zeugmann
    A Complete and Tight Average-Case Analysis of Learning Monomials. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:414-423 [Conf]
  43. Thomas Zeugmann
    Inductive Inference and Language Learning. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:464-473 [Conf]
  44. Thomas Zeugmann
    Lange and Wiehagen's Pattern Language Learning Algorithm: An Average-Case Analysis with Respect to its Total Learning Time. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1998, v:23, n:1-2, pp:117-145 [Journal]
  45. John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
    A Polynomial Time Learner for a Subclass of Regular Patterns [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:038, pp:- [Journal]
  46. Efim B. Kinber, Thomas Zeugmann
    Inductive Inference of Almost Everywhere Correct Programs by Reliably Working Strategies. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1985, v:21, n:3, pp:91-100 [Journal]
  47. Thomas Zeugmann
    A-posteriori Characterizations in Inductive Inference of Recursive Functions. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1983, v:19, n:10/11, pp:559-594 [Journal]
  48. Thomas Zeugmann
    On the Synthesis of Fastest Programs in Inductive Inference. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1983, v:19, n:12, pp:625-642 [Journal]
  49. Thomas Zeugmann
    Improved Parallel Computations in the Ring Z/palpha. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1989, v:25, n:10, pp:543-547 [Journal]
  50. William I. Gasarch, Efim B. Kinber, Mark G. Pleszkoch, Carl H. Smith, Thomas Zeugmann
    Learning via Queries with Teams and Anomalies. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:23, n:1, pp:67-89 [Journal]
  51. John Case, Sanjay Jain, Steffen Lange, Thomas Zeugmann
    Incremental Concept Learning for Bounded Data Mining. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:152, n:1, pp:74-110 [Journal]
  52. Efim B. Kinber, Thomas Zeugmann
    One-Sided Error Probabilistic Inductive Inference and Reliable Frequency Identification [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:92, n:2, pp:253-284 [Journal]
  53. Thomas Zeugmann
    Highly Parallel Computations Modulo a Number Having Only Small Prime Factors [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:96, n:1, pp:95-114 [Journal]
  54. Thomas Zeugmann, Steffen Lange, Shyam Kapur
    Characterizations of Monotonic and Dual Monotonic Language Learning [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:2, pp:155-173 [Journal]
  55. Steffen Lange, Thomas Zeugmann
    Learning Recursive Languages with Bounded Mind Changes. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:2, pp:157-178 [Journal]
  56. Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann
    Classifying Predicates and Languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1997, v:8, n:1, pp:15-0 [Journal]
  57. Steffen Lange, Thomas Zeugmann
    Incremental Learning from Positive Data. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:1, pp:88-103 [Journal]
  58. Rüdiger Reischuk, Thomas Zeugmann
    An Average-Case Optimal One-Variable Pattern Language Learner. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:2, pp:302-335 [Journal]
  59. Rolf Wiehagen, Thomas Zeugmann
    Ignoring data may be the only way to learn efficiently. [Citation Graph (0, 0)][DBLP]
    J. Exp. Theor. Artif. Intell., 1994, v:6, n:, pp:131-144 [Journal]
  60. Peter Rossmanith, Thomas Zeugmann
    Stochastic Finite Learning of the Pattern Languages. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2001, v:44, n:1/2, pp:67-91 [Journal]
  61. Steffen Lange, Thomas Zeugmann
    Set-Driven and Rearrangement-Independent Learning of Recursive Languages. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:6, pp:599-634 [Journal]
  62. Nicolò Cesa-Bianchi, Rüdiger Reischuk, Thomas Zeugmann
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:1, pp:1-2 [Journal]
  63. Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann
    Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:261, n:1, pp:119-156 [Journal]
  64. Sanjay Jain, Efim B. Kinber, Steffen Lange, Rolf Wiehagen, Thomas Zeugmann
    Learning languages and functions by erasing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:241, n:1-2, pp:143-189 [Journal]
  65. Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann
    On learning of functions refutably. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:298, pp:111-143 [Journal]
  66. Steffen Lange, Gunter Grieser, Thomas Zeugmann
    Inductive inference of approximations for recursive concepts. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:1, pp:15-40 [Journal]
  67. Steffen Lange, Thomas Zeugmann, Shyam Kapur
    Monotonic and Dual Monotonic Language Learning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:2, pp:365-410 [Journal]
  68. Frank Stephan, Thomas Zeugmann
    Learning classes of approximations to non-recursive function. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:288, n:2, pp:309-341 [Journal]
  69. Rolf Wiehagen, Thomas Zeugmann
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:2, pp:175-177 [Journal]
  70. Thomas Zeugmann
    On the Power of Recursive Optimizers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:62, n:3, pp:289-310 [Journal]
  71. Thomas Zeugmann
    From learning in the limit to stochastic finite learning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:364, n:1, pp:77-97 [Journal]
  72. John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
    Learning a subclass of regular patterns in polynomial time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:364, n:1, pp:115-131 [Journal]
  73. Shai Ben-David, John Case, Thomas Zeugmann
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:3, pp:167-169 [Journal]

  74. Editors' Introduction. [Citation Graph (, )][DBLP]


  75. Clustering the Normalized Compression Distance for Influenza Virus Data. [Citation Graph (, )][DBLP]


  76. On the Teachability of Randomized Learners. [Citation Graph (, )][DBLP]


  77. Relational Properties Expressible with One Universal Quantifier Are Testable. [Citation Graph (, )][DBLP]


  78. Indistinguishability and First-Order Logic. [Citation Graph (, )][DBLP]


  79. A Note on the Testability of Ramsey's Class. [Citation Graph (, )][DBLP]


  80. Recent Developments in Algorithmic Teaching. [Citation Graph (, )][DBLP]


  81. Untestable Properties Expressible with Four First-Order Quantifiers. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.010secs
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