Thomas Zeugmann

According to our database, Thomas Zeugmann authored at least 125 papers between 1983 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

On the amount of nonconstructivity in learning formal languages from text.

Sanjay Jain, Frank Stephan, Thomas Zeugmann

Inf. Comput., 2021

2020

On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings.

Thomas Zeugmann

Proceedings of the Beyond the Horizon of Computability, 2020

2018

Guest Editor's Foreword.

Thomas Zeugmann

Theor. Comput. Sci., 2018

On the Help of Bounded Shot Verifiers, Comparators and Standardisers for Learnability in Inductive Inference.

Ziyuan Gao, Sanjay Jain, Frank Stephan, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 2018

2017

VC Dimension.

Thomas Zeugmann

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Stochastic Finite Learning.

Thomas Zeugmann

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

PAC Learning.

Thomas Zeugmann

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Epsilon Nets.

Thomas Zeugmann

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Epsilon Cover.

Thomas Zeugmann

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

2016

Guest Editors' foreword.

Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann

Theor. Comput. Sci., 2016

Guest editors' foreword.

Peter Auer, Alexander Clark, Thomas Zeugmann

Theor. Comput. Sci., 2016

Obituary Rūsiņš Mārtiņš Freivalds (1942-2016).

Thomas Zeugmann

Bull. EATCS, 2016

The Kahr-Moore-Wang Class Contains Untestable Properties.

Charles Jordan, Thomas Zeugmann

Balt. J. Mod. Comput., 2016

Mathematical Analysis and the Mathematics of Computation

Werner Römisch, Thomas Zeugmann

Springer, ISBN: 978-3-319-42755-3, 2016

2015

Image Analysis in a Parameter-Free Setting.

Yu Zhu, Thomas Zeugmann

Proceedings of the Information Sciences and Systems 2015, 2015

2014

Guest Editors' introduction.

Jyrki Kivinen, Csaba Szepesvári, Thomas Zeugmann

Theor. Comput. Sci., 2014

Guest Editors' foreword.

Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann

Theor. Comput. Sci., 2014

On the Influence of Technology on Learning Processes.

Ilja Kucevalovs, Ojars Krasts, Rusins Freivalds, Thomas Zeugmann

Parallel Process. Lett., 2014

Active Learning of Recursive Functions by Ultrametric Algorithms.

Rusins Freivalds, Thomas Zeugmann

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Editors' Introduction.

Peter Auer, Alexander Clark, Thomas Zeugmann, Sandra Zilles

Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

2013

Guest Editors' foreword.

Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann

Theor. Comput. Sci., 2013

On the Size Complexity of Deterministic Frequency Automata.

Rusins Freivalds, Thomas Zeugmann, Grant R. Pogosyan

Proceedings of the Language and Automata Theory and Applications, 2013

Editors' Introduction.

Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory - 24th International Conference, 2013

2012

Testable and untestable classes of first-order formulae.

Charles Jordan, Thomas Zeugmann

J. Comput. Syst. Sci., 2012

On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data.

Sanjay Jain, Frank Stephan, Thomas Zeugmann

Proceedings of the Theory and Applications of Models of Computation, 2012

Editors' Introduction.

Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011

Teaching randomized learners with feedback.

Frank J. Balbach, Thomas Zeugmann

Inf. Comput., 2011

Untestable Properties in the Kahr-Moore-Wang Class.

Charles Jordan, Thomas Zeugmann

Proceedings of the Logic, Language, Information and Computation, 2011

On the Amount of Nonconstructivity in Learning Recursive Functions.

Rusins Freivalds, Thomas Zeugmann

Proceedings of the Theory and Applications of Models of Computation, 2011

On the Parameterised Complexity of Learning Patterns.

Frank Stephan, Ryo Yoshinaka, Thomas Zeugmann

Proceedings of the Computer and Information Sciences II, 2011

Editors' Introduction.

Jyrki Kivinen, Csaba Szepesvári, Esko Ukkonen, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010

VC Dimension.

Thomas Zeugmann

Proceedings of the Encyclopedia of Machine Learning, 2010

Stochastic Finite Learning.

Thomas Zeugmann

Proceedings of the Encyclopedia of Machine Learning, 2010

PAC Learning.

Thomas Zeugmann

Proceedings of the Encyclopedia of Machine Learning, 2010

Epsilon Nets.

Thomas Zeugmann

Proceedings of the Encyclopedia of Machine Learning, 2010

Epsilon Covers.

Thomas Zeugmann

Proceedings of the Encyclopedia of Machine Learning, 2010

Guest editors' foreword.

László Györfi, György Turán, Thomas Zeugmann

Theor. Comput. Sci., 2010

A Note on the Testability of Ramsey's Class.

Charles Jordan, Thomas Zeugmann

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Untestable Properties Expressible with Four First-Order Quantifiers.

Charles Jordan, Thomas Zeugmann

Proceedings of the Language and Automata Theory and Applications, 2010

Recent Experiences in Parameter-Free Data Mining.

Kimihito Ito, Thomas Zeugmann, Yu Zhu

Proceedings of the Computer and Information Sciences, 2010

Clustering the Normalized Compression Distance for Influenza Virus Data.

Kimihito Ito, Thomas Zeugmann, Yu Zhu

Proceedings of the Algorithms and Applications, 2010

Editors' Introduction.

Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009

Relational Properties Expressible with One Universal Quantifier Are Testable.

Charles Jordan, Thomas Zeugmann

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

Recent Developments in Algorithmic Teaching.

Frank J. Balbach, Thomas Zeugmann

Proceedings of the Language and Automata Theory and Applications, 2009

2008

Learning recursive functions: A survey.

Thomas Zeugmann, Sandra Zilles

Theor. Comput. Sci., 2008

Learning indexed families of recursive languages from positive data: A survey.

Steffen Lange, Thomas Zeugmann, Sandra Zilles

Theor. Comput. Sci., 2008

Foreword.

John Case, Takeshi Shinohara, Thomas Zeugmann, Sandra Zilles

Theor. Comput. Sci., 2008

Consistent and coherent learning with delta-delay.

Yohji Akama, Thomas Zeugmann

Inf. Comput., 2008

Indistinguishability and First-Order Logic.

Skip Jordan, Thomas Zeugmann

Proceedings of the Theory and Applications of Models of Computation, 2008

2007

Foreword.

Shai Ben-David, John Case, Thomas Zeugmann

Theor. Comput. Sci., 2007

2006

From learning in the limit to stochastic finite learning.

Thomas Zeugmann

Theor. Comput. Sci., 2006

Foreword.

Nicolò Cesa-Bianchi, Rüdiger Reischuk, Thomas Zeugmann

Theor. Comput. Sci., 2006

Learning a subclass of regular patterns in polynomial time.

John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann

Theor. Comput. Sci., 2006

Inductive Inference and Language Learning.

Thomas Zeugmann

Proceedings of the Theory and Applications of Models of Computation, 2006

N-Gram Analysis Based on Zero-Suppressed BDDs.

Ryutaro Kurai, Shin-ichi Minato, Thomas Zeugmann

Proceedings of the New Frontiers in Artificial Intelligence, 2006

Consistency Conditions for Inductive Inference of Recursive Functions.

Yohji Akama, Thomas Zeugmann

Proceedings of the New Frontiers in Artificial Intelligence, 2006

Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts.

Jan Poland, Thomas Zeugmann

Proceedings of the Discovery Science, 9th International Conference, 2006

On the Teachability of Randomized Learners.

Frank J. Balbach, Thomas Zeugmann

Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

Teaching Randomized Learners.

Frank J. Balbach, Thomas Zeugmann

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

Teaching Memoryless Randomized Learners Without Feedback.

Frank J. Balbach, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2005

Inductive inference of approximations for recursive concepts.

Steffen Lange, Gunter Grieser, Thomas Zeugmann

Theor. Comput. Sci., 2005

Text Mining Using Markov Chains of Variable Length.

Björn Hoffmeister, Thomas Zeugmann

Proceedings of the Federation over the Web, 2005

Teaching Learners with Restricted Mind Changes.

Frank J. Balbach, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004

A Polynomial Time Learner for a Subclass of Regular Patterns

John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann

Electron. Colloquium Comput. Complex., 2004

2003

On learning of functions refutably.

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann

Theor. Comput. Sci., 2003

Can Learning in the Limit Be Done Efficiently?

Thomas Zeugmann

Proceedings of the Discovery Science, 6th International Conference, 2003

2002

Learning classes of approximations to non-recursive function.

Frank Stephan, Thomas Zeugmann

Theor. Comput. Sci., 2002

2001

Foreword.

Rolf Wiehagen, Thomas Zeugmann

Theor. Comput. Sci., 2001

Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries.

Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann

Theor. Comput. Sci., 2001

Stochastic Finite Learning of the Pattern Languages.

Peter Rossmanith, Thomas Zeugmann

Mach. Learn., 2001

Stochastic Finite Learning.

Thomas Zeugmann

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2001

Learning Recursive Functions Refutably.

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

Editors' Introduction.

Naoki Abe, Roni Khardon, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000

Learning languages and functions by erasing.

Sanjay Jain, Efim B. Kinber, Steffen Lange, Rolf Wiehagen, Thomas Zeugmann

Theor. Comput. Sci., 2000

An Average-Case Optimal One-Variable Pattern Language Learner.

Rüdiger Reischuk, Thomas Zeugmann

J. Comput. Syst. Sci., 2000

Average-Case Complexity of Learning Polynomials.

Frank Stephan, Thomas Zeugmann

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

Learning Recursive Concepts with Anomalies.

Gunter Grieser, Steffen Lange, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 11th International Conference, 2000

1999

Incremental Concept Learning for Bounded Data Mining.

John Case, Sanjay Jain, Steffen Lange, Thomas Zeugmann

Inf. Comput., 1999

A Complete and Tight Average-Case Analysis of Learning Monomials.

Rüdiger Reischuk, Thomas Zeugmann

Proceedings of the STACS 99, 1999

On the Uniform Learnability of Approximations to Non-Recursive Functions.

Frank Stephan, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999

1998

Lange and Wiehagen's Pattern Language Learning Algorithm: An Average-Case Analysis with Respect to its Total Learning Time.

Thomas Zeugmann

Ann. Math. Artif. Intell., 1998

Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data.

Peter Rossmanith, Thomas Zeugmann

Proceedings of the Grammatical Inference, 4th International Colloquium, 1998

Learning One-Variable Pattern Languages in Linear Average Time.

Rüdiger Reischuk, Thomas Zeugmann

Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

Editor's Introduction.

Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997

Classifying Predicates and Languages.

Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann

Int. J. Found. Comput. Sci., 1997

1996

Monotonic and Dual Monotonic Language Learning.

Steffen Lange, Thomas Zeugmann, Shyam Kapur

Theor. Comput. Sci., 1996

Set-Driven and Rearrangement-Independent Learning of Recursive Languages.

Steffen Lange, Thomas Zeugmann

Math. Syst. Theory, 1996

Incremental Learning from Positive Data.

Steffen Lange, Thomas Zeugmann

J. Comput. Syst. Sci., 1996

Co-Learning of Recursive Languages from Positive Data.

Rusins Freivalds, Thomas Zeugmann

Proceedings of the Perspectives of System Informatics, 1996

Learning by Erasing.

Steffen Lange, Rolf Wiehagen, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995

Characterizations of Monotonic and Dual Monotonic Language Learning

Thomas Zeugmann, Steffen Lange, Shyam Kapur

Inf. Comput., August, 1995

Learning via Queries with Teams and Anomalies.

William I. Gasarch, Efim B. Kinber, Mark G. Pleszkoch, Carl H. Smith, Thomas Zeugmann

Fundam. Informaticae, 1995

A Guided Tour Across the Boundaries of Learning Recursive Languages.

Thomas Zeugmann, Steffen Lange

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Learning and Consistency.

Rolf Wiehagen, Thomas Zeugmann

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Classifying Recursive Predicates and Languages.

Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Trading monotonicity demands versus mind changes.

Steffen Lange, Thomas Zeugmann

Proceedings of the Computational Learning Theory, Second European Conference, 1995

Editor's Introduction.

Klaus P. Jantke, Takeshi Shinohara, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994

Report on COLT 1994.

Thomas Zeugmann

SIGACT News, 1994

Ignoring data may be the only way to learn efficiently.

Rolf Wiehagen, Thomas Zeugmann

J. Exp. Theor. Artif. Intell., 1994

Characterization of language learning front informant under various monotonicity constraints.

Steffen Lange, Thomas Zeugmann

J. Exp. Theor. Artif. Intell., 1994

Average Case Analysis of Pattern Language Learning Algorithms (Abstract).

Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 1994

1993

Learning Recursive Languages with Bounded Mind Changes.

Steffen Lange, Thomas Zeugmann

Int. J. Found. Comput. Sci., 1993

Language Learning with a Bounded Number of Mind Changes.

Steffen Lange, Thomas Zeugmann

Proceedings of the STACS 93, 1993

Classification of predicates and languages.

Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann

Proceedings of the First European Conference on Computational Learning Theory, 1993

Language Learning in Dependence on the Space of Hypotheses.

Steffen Lange, Thomas Zeugmann

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992

Highly Parallel Computations Modulo a Number Having Only Small Prime Factors

Thomas Zeugmann

Inf. Comput., January, 1992

Types of Monotonic Language Learning and Their Characterization.

Steffen Lange, Thomas Zeugmann

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

Too Much Can be Too Much for Learning Efficiently.

Rolf Wiehagen, Thomas Zeugmann

Proceedings of the Analogical and Inductive Inference, 1992

A Unifying Approach to Monotonic Language Learning on Informant.

Steffen Lange, Thomas Zeugmann

Proceedings of the Analogical and Inductive Inference, 1992

1991

One-Sided Error Probabilistic Inductive Inference and Reliable Frequency Identification

Efim B. Kinber, Thomas Zeugmann

Inf. Comput., June, 1991

Monotonic Versus Nonmonotonic Language Learning.

Steffen Lange, Thomas Zeugmann

Proceedings of the Nonmonotonic and Inductive Logic, 1991

1990

Inductive Inference of Optimal Programs: A Survey and Open Problems.

Thomas Zeugmann

Proceedings of the Nonmonotonic and Inductive Logic, 1990

Computing Large Polynomial Powers Very Fast in Parallel.

Thomas Zeugmann

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Learning Via Queries With Teams and Anomilies.

Efim B. Kinber, William I. Gasarch, Thomas Zeugmann, Mark G. Pleszkoch, Carl H. Smith

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989

Improved Parallel Computations in the Ring Z/p^alpha.

Thomas Zeugmann

J. Inf. Process. Cybern., 1989

Monte-Carlo Inference and Its Relations to Reliable Frequency Identification.

Efim B. Kinber, Thomas Zeugmann

Proceedings of the Fundamentals of Computation Theory, 1989

Refined Query Inference (Extended Abstract).

Efim B. Kinber, Thomas Zeugmann

Proceedings of the Analogical and Inductive Inference, 1989

1988

On the Power of Recursive Optimizers.

Thomas Zeugmann

Theor. Comput. Sci., 1988

1986

On Barzdin's Conjecture.

Thomas Zeugmann

Proceedings of the Analogical and Inductive Inference, 1986

1985

Inductive Inference of Almost Everywhere Correct Programs by Reliably Working Strategies.

Efim B. Kinber, Thomas Zeugmann

J. Inf. Process. Cybern., 1985

On recursive optimizers.

Thomas Zeugmann

Proceedings of the Mathematical Methods of Specification and Synthesis of Software Systems '85, 1985

1984

On the Nonboundability of total Effective Operators.

Thomas Zeugmann

Math. Log. Q., 1984

1983

Zur algorithmischen Synthese von schnellen Programmen.

Thomas Zeugmann

PhD thesis, 1983

On the Synthesis of Fastest Programs in Inductive Inference.

Thomas Zeugmann

J. Inf. Process. Cybern., 1983

A-posteriori Characterizations in Inductive Inference of Recursive Functions.

Thomas Zeugmann

J. Inf. Process. Cybern., 1983