Hokkaido University
Graduate School of Information Science and Technology
Division of Computer Science
Knowledge Software Science Research Group
Laboratory for Algorithmics
Thomas Zeugmann

Members
Research

Publications

Teaching

TCS Technical Report Series

Archives of ALT-Conferences

Archives of AII-Workshops

COLTBIB

ALT 2012
DS-LOGO

Conferences

Miscellaneous


Hokkaido University

Journal Papers

  1. Thomas Zeugmann,
    A posteriori Characterizations in Inductive Inference of Recursive Functions,
    Journal of Information Processing and Cybernetics (EIK) 19, No. 10/11, 1983, 559 - 594.
    Abstract

  2. Thomas Zeugmann,
    On the Synthesis of Fastest Programs in Inductive Inference,
    Journal of Information Processing and Cybernetics (EIK) 19, No. 12, 1983, 625 - 642.
    Abstract.

  3. Thomas Zeugmann,
    On the Nonboundability of Total Effective Operators,
    Zeitschrift für mathematische Logik und Grundlagen der Mathematik, Vol. 30, Issues 9-11, 1984, 169 - 172.

  4. Efim B. Kinber and Thomas Zeugmann,
    Inductive Inference of Almost Everywhere Correct Programs by Reliably Working Strategies,
    Journal of Information Processing and Cybernetics (EIK) 21, No. 3, 1985, 91 - 100.

  5. Thomas Zeugmann,
    On the Power of Recursive Optimizers,
    Theoretical Computer Science 62, 1988, 289 - 310.
    Abstract.

  6. Thomas Zeugmann,
    Improved Parallel Computations in the Ring Zpα,
    Journal of Information Processing and Cybernetics (EIK) 25, No. 10, 1989, 543 - 547.
    Abstract.

  7. Efim Kinber and Thomas Zeugmann,
    One-Sided Error Probabilistic Inductive Inference and Reliable Frequency Identification,
    Information & Computation Vol. 92, No. 2, 1991, 253 - 284.
    Abstract.

  8. Thomas Zeugmann,
    Highly Parallel Computations modulo a Number Having only Small Prime Factors,
    Information & Computation Vol. 96, No. 1, 1992, 95 - 114.
    Abstract

  9. Steffen Lange and Thomas Zeugmann,
    Learning Recursive Languages with Bounded Mind Changes,
    International Journal of Foundations of Computer Science Vol. 4, No. 2, 1993, 157 - 178.
    Abstract.

  10. Steffen Lange and Thomas Zeugmann,
    Characterization of Language Learning from Informant under various Monotonicity Constraints,
    Journal of Experimental & Theoretical Artificial Intelligence 6, No. 1, 1994, 73 - 94.
    Special issue Algorithmic Learning Theory.
    Abstract

  11. Rolf Wiehagen and Thomas Zeugmann,
    Ignoring Data May be the Only Way to Learn Efficiently,
    Journal of Experimental & Theoretical Artificial Intelligence 6, No. 1, 1994, 131 - 144.
    Special issue Algorithmic Learning Theory.
    Abstract

  12. William I. Gasarch, Efim B. Kinber, Mark G. Pleszkoch, Carl H. Smith, and Thomas Zeugmann,
    Learning via Queries with Teams and Anomalies,
    Fundamenta Informaticae Vol. 23, Number 1, May 1995, 67-89.
    Abstract.

  13. Steffen Lange and Thomas Zeugmann,
    Trading Monotonicity Demands versus Efficiency,
    Bulletin of Informatics and Cybernetics 27, No.1, 1995, pp. 53 - 83.
    Abstract.

  14. Thomas Zeugmann, Steffen Lange, and Shyam Kapur,
    Characterizations of Monotonic and Dual Monotonic Language Learning,
    Information & Computation 120, No. 2, 1995, 155 - 173.
    Abstract.

  15. Steffen Lange, Thomas Zeugmann, and Shyam Kapur,
    Monotonic and Dual Monotonic Language Learning,
    Theoretical Computer Science 155, No. 2, 1996, 365 - 410.
    Abstract.

  16. Steffen Lange and Thomas Zeugmann,
    Incremental Learning from Positive Data,
    Journal of Computer and System Sciences 53, No. 1, 1996, 88 - 103.
    Abstract.

  17. Steffen Lange and Thomas Zeugmann,
    Set-Driven and Rearrangement-Independent Learning of Recursive Languages,
    Mathematical Systems Theory, 29, No. 6, 1996, 599 - 634.
    Abstract.

  18. Carl H. Smith, Rolf Wiehagen, and Thomas Zeugmann,
    Classifying Predicates and Languages,
    International Journal of Foundations of Computer Science 8, No. 1, 1997, 15 - 41.
    Abstract.

  19. Thomas Zeugmann,
    Lange and Wiehagen's Pattern Language Learning Algorithm: An Average-Case Analysis with respect to its Total Learning Time,
    Annals of Mathematics and Artificial Intelligence Vol. 23, No. 1-2, 1998, 117-145,
    (Special Issue for ALT '94 and AII '94). Abstract or as xbm-file Abstract.

  20. John Case, Sanjay Jain, Steffen Lange, and Thomas Zeugmann,
    Incremental Concept Learning for Bounded Data Mining,
    Information & Computation Vol. 152, No. 1, 1999, 74-110.
    Abstract.

  21. Rüdiger Reischuk and Thomas Zeugmann,
    An Average-Case Optimal One-Variable Pattern Language Learner,
    Journal of Computer and System Sciences Vol. 60, No. 2, 2000, 302-335.
    (Special Issue for COLT '98). Abstract.

  22. Sanjay Jain, Efim Kinber, Steffen Lange, Rolf Wiehagen, and Thomas Zeugmann,
    Learning languages and functions by erasing,
    Theoretical Computer Science Vol. 241, No. 1-2, 2000, 143-189.
    (Special Issue ALT '96). Abstract.

  23. Peter Rossmanith and Thomas Zeugmann,
    Stochastic Finite Learning of the Pattern Languages,
    Machine Learning Vol. 44, No. 1/2, 2001, 67-91.
    (Special Issue on Automata Induction, Grammar Inference, and Language Acquisition), Abstract.

  24. Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, and Thomas Zeugmann,
    Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries,
    Theoretical Computer Science Vol. 261, Issue 1, 2001, 119-156.
    (Special Issue for ALT '97).
    Abstract (and link to our pattern language learning page).

  25. Frank Stephan and Thomas Zeugmann,
    Learning Classes of Approximations to Non-Recursive Functions,
    Theoretical Computer Science Vol. 288, Issue 2, 2002, 309-341.
    (Special Issue ALT '99).
    Abstract.

  26. Sanjay Jain, Efim Kinber, Rolf Wiehagen, and Thomas Zeugmann,
    On Learning of Functions Refutably,
    Theoretical Computer Science Vol. 298, Issue 1, 2003, 111-143.
    Abstract.

  27. Steffen Lange, Gunter Grieser, and Thomas Zeugmann,
    Inductive Inference of Approximations for Recursive Concepts,
    Theoretical Computer Science Vol. 348, Issue 1, 2005, 15-40.
    (Special Issue Algorithmic Learning Theory (ALT 2000))
    Abstract.

  28. Thomas Zeugmann,
    From Learning in the Limit to Stochastic Finite Learning,
    Theoretical Computer Science, Vol. 364, Issue 1, 2006, 77-97.
    (Special Issue Algorithmic Learning Theory (ALT 2003))
    Abstract.

  29. John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, and Thomas Zeugmann,
    Learning a Subclass of Regular Patterns in Polynomial Time,
    Theoretical Computer Science, Vol. 364, Issue 1, 2006, 115-131.
    (Special Issue Algorithmic Learning Theory (ALT 2003))
    Abstract.

  30. Thomas Zeugmann and Sandra Zilles,
    Learning recursive functions: A survey,
    Theoretical Computer Science, Vol. 397, Issues 1-3, 2008, 4-56.
    (Special Issue Forty Years of Inductive Inference: Dedicated to the 60th Birthday of Rolf Wiehagen)
    Abstract.

  31. Steffen Lange, Thomas Zeugmann, and Sandra Zilles,
    Learning indexed families of recursive languages from positive data: A survey,
    Theoretical Computer Science, Vol. 397, Issues 1-3, 2008, 194-232.
    (Special Issue Forty Years of Inductive Inference: Dedicated to the 60th Birthday of Rolf Wiehagen)
    Abstract.

  32. Yohji Akama and Thomas Zeugmann,
    Consistent and coherent learning with δ-delay,
    Information & Computation, Vol. 206, Issue 11, 2008, 1362-1374.
    Abstract.

  33. Haruya Iwasaki, Shin-ichi Minato, and Thomas Zeugmann,
    A Method of ZBDD Variable Ordering for Frequent Pattern Mining (頻出パターンマイニングのためのゼロサプレス型 BDD の変数順序付け方法とその評価),
    The IEICE Transactions on Information and Systems (Japanese Edition)
    (電子情報通信学会論文誌)    , Vol. J91-D, No. 3, 2008, 608-618, in Japanese.
    Abstract.

  34. Frank J. Balbach and Thomas Zeugmann,
    Teaching Randomized Learners with Feedback,
    Information & Computation, Vol. 209, Issue 3, 2011, 296-319.
    (Special Issue for LATA 2009),
    Abstract.

  35. Charles Jordan and Thomas Zeugmann,
    Testable and untestable classes of first-order formulae,
    Journal of Computer and System Sciences, to appear 2012.
    Abstract.
For further information, please contact
Thomas Zeugmann
Mailbox "thomas" at "ist.hokudai.ac.jp"

©Copyright Notice:
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
This page is updated whenever new information is available.

Last update March 15, 2012.

Valid HTML 4.1