Thomas Zeugmann

Publication Activity (10 Years)

Years Active: 1983-2021
Publications (10 Years): 9

Top Venues

Theor. Comput. Sci.

ALT

ISCIS

J. Comput. Syst. Sci.

Humboldt University of Berlin, Unter den Linden, Germany (PHD)

Education History

Humboldt University of Berlin, Unter den Linden, Germany

PHD

Publications

Sanjay Jain, Frank Stephan, Thomas Zeugmann
On the amount of nonconstructivity in learning formal languages from text. Inf. Comput. 281 (2021)
Thomas Zeugmann
On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings. CiE (2020)
Ziyuan Gao, Sanjay Jain, Frank Stephan, Thomas Zeugmann
On the Help of Bounded Shot Verifiers, Comparators and Standardisers for Learnability in Inductive Inference. ALT (2018)
Thomas Zeugmann
Guest Editor's Foreword. Theor. Comput. Sci. 733 (2018)
Charles Jordan, Thomas Zeugmann
The Kahr-Moore-Wang Class Contains Untestable Properties. Balt. J. Mod. Comput. 4 (4) (2016)
Thomas Zeugmann
Obituary Rūsiņš Mārtiņš Freivalds (1942-2016). Bull. EATCS 118 (2016)
Peter Auer, Alexander Clark, Thomas Zeugmann
Guest editors' foreword. Theor. Comput. Sci. 650 (2016)
Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann
Guest Editors' foreword. Theor. Comput. Sci. 620 (2016)
Yu Zhu, Thomas Zeugmann
Image Analysis in a Parameter-Free Setting. ISCIS (2015)
Jyrki Kivinen, Csaba Szepesvári, Thomas Zeugmann
Guest Editors' introduction. Theor. Comput. Sci. 519 (2014)
Ilja Kucevalovs, Ojars Krasts, Rusins Freivalds, Thomas Zeugmann
On the Influence of Technology on Learning Processes. Parallel Process. Lett. 24 (2) (2014)
Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann
Guest Editors' foreword. Theor. Comput. Sci. 558 (2014)
Rusins Freivalds, Thomas Zeugmann
Active Learning of Recursive Functions by Ultrametric Algorithms. SOFSEM (2014)
Peter Auer, Alexander Clark, Thomas Zeugmann, Sandra Zilles
Editors' Introduction. ALT (2014)
Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann
Editors' Introduction. ALT (2013)
Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann
Guest Editors' foreword. Theor. Comput. Sci. 473 (2013)
Rusins Freivalds, Thomas Zeugmann, Grant R. Pogosyan
On the Size Complexity of Deterministic Frequency Automata. LATA (2013)
Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann
Editors' Introduction. ALT (2012)
Charles Jordan, Thomas Zeugmann
Testable and untestable classes of first-order formulae. J. Comput. Syst. Sci. 78 (5) (2012)
Sanjay Jain, Frank Stephan, Thomas Zeugmann
On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data. TAMC (2012)
Jyrki Kivinen, Csaba Szepesvári, Esko Ukkonen, Thomas Zeugmann
Editors' Introduction. ALT (2011)
Charles Jordan, Thomas Zeugmann
Untestable Properties in the Kahr-Moore-Wang Class. WoLLIC (2011)
Frank Stephan, Ryo Yoshinaka, Thomas Zeugmann
On the Parameterised Complexity of Learning Patterns. ISCIS (2011)
Rusins Freivalds, Thomas Zeugmann
On the Amount of Nonconstructivity in Learning Recursive Functions. TAMC (2011)
Frank J. Balbach, Thomas Zeugmann
Teaching randomized learners with feedback. Inf. Comput. 209 (3) (2011)
Kimihito Ito, Thomas Zeugmann, Yu Zhu
Clustering the Normalized Compression Distance for Influenza Virus Data. Algorithms and Applications (2010)
Charles Jordan, Thomas Zeugmann
A Note on the Testability of Ramsey's Class. TAMC (2010)
Charles Jordan, Thomas Zeugmann
Untestable Properties Expressible with Four First-Order Quantifiers. LATA (2010)
Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann
Editors' Introduction. ALT (2010)
László Györfi, György Turán, Thomas Zeugmann
Guest editors' foreword. Theor. Comput. Sci. 411 (29-30) (2010)
Kimihito Ito, Thomas Zeugmann, Yu Zhu
Recent Experiences in Parameter-Free Data Mining. ISCIS (2010)
Frank J. Balbach, Thomas Zeugmann
Recent Developments in Algorithmic Teaching. LATA (2009)
Charles Jordan, Thomas Zeugmann
Relational Properties Expressible with One Universal Quantifier Are Testable. SAGA (2009)
Yohji Akama, Thomas Zeugmann
Consistent and coherent learning with delta-delay. Inf. Comput. 206 (11) (2008)
Thomas Zeugmann, Sandra Zilles
Learning recursive functions: A survey. Theor. Comput. Sci. 397 (1-3) (2008)
Skip Jordan, Thomas Zeugmann
Indistinguishability and First-Order Logic. TAMC (2008)
Steffen Lange, Thomas Zeugmann, Sandra Zilles
Learning indexed families of recursive languages from positive data: A survey. Theor. Comput. Sci. 397 (1-3) (2008)
John Case, Takeshi Shinohara, Thomas Zeugmann, Sandra Zilles
Foreword. Theor. Comput. Sci. 397 (1-3) (2008)
Shai Ben-David, John Case, Thomas Zeugmann
Foreword. Theor. Comput. Sci. 382 (3) (2007)
Thomas Zeugmann
From learning in the limit to stochastic finite learning. Theor. Comput. Sci. 364 (1) (2006)
Frank J. Balbach, Thomas Zeugmann
Teaching Randomized Learners. COLT (2006)
John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
Learning a subclass of regular patterns in polynomial time. Theor. Comput. Sci. 364 (1) (2006)
Frank J. Balbach, Thomas Zeugmann
Teaching Memoryless Randomized Learners Without Feedback. ALT (2006)
Frank J. Balbach, Thomas Zeugmann
On the Teachability of Randomized Learners. Complexity of Boolean Functions (2006)
Nicolò Cesa-Bianchi, Rüdiger Reischuk, Thomas Zeugmann
Foreword. Theor. Comput. Sci. 350 (1) (2006)
Thomas Zeugmann
Inductive Inference and Language Learning. TAMC (2006)
Yohji Akama, Thomas Zeugmann
Consistency Conditions for Inductive Inference of Recursive Functions. JSAI (2006)
Jan Poland, Thomas Zeugmann
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts. Discovery Science (2006)
Ryutaro Kurai, Shin-ichi Minato, Thomas Zeugmann
N-Gram Analysis Based on Zero-Suppressed BDDs. JSAI (2006)
Steffen Lange, Gunter Grieser, Thomas Zeugmann
Inductive inference of approximations for recursive concepts. Theor. Comput. Sci. 348 (1) (2005)
Björn Hoffmeister, Thomas Zeugmann
Text Mining Using Markov Chains of Variable Length. Federation over the Web (2005)
Frank J. Balbach, Thomas Zeugmann
Teaching Learners with Restricted Mind Changes. ALT (2005)
John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
A Polynomial Time Learner for a Subclass of Regular Patterns Electron. Colloquium Comput. Complex. (038) (2004)
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann
On learning of functions refutably. Theor. Comput. Sci. 298 (1) (2003)
John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
Learning a Subclass of Regular Patterns in Polynomial Time. ALT (2003)
Thomas Zeugmann
Can Learning in the Limit Be Done Efficiently? Discovery Science (2003)
Thomas Zeugmann
Can Learning in the Limit Be Done Efficiently? ALT (2003)
Frank Stephan, Thomas Zeugmann
Learning classes of approximations to non-recursive function. Theor. Comput. Sci. 288 (2) (2002)
Peter Rossmanith, Thomas Zeugmann
Stochastic Finite Learning of the Pattern Languages. Mach. Learn. 44 (1/2) (2001)
Naoki Abe, Roni Khardon, Thomas Zeugmann
Editors' Introduction. ALT (2001)
Thomas Zeugmann
Stochastic Finite Learning. SAGA (2001)
Rolf Wiehagen, Thomas Zeugmann
Foreword. Theor. Comput. Sci. 268 (2) (2001)
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. Theor. Comput. Sci. 261 (1) (2001)
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann
Learning Recursive Functions Refutably. ALT (2001)
Sanjay Jain, Efim B. Kinber, Steffen Lange, Rolf Wiehagen, Thomas Zeugmann
Learning languages and functions by erasing. Theor. Comput. Sci. 241 (1-2) (2000)
Rüdiger Reischuk, Thomas Zeugmann
An Average-Case Optimal One-Variable Pattern Language Learner. J. Comput. Syst. Sci. 60 (2) (2000)
Frank Stephan, Thomas Zeugmann
Average-Case Complexity of Learning Polynomials. COLT (2000)
Gunter Grieser, Steffen Lange, Thomas Zeugmann
Learning Recursive Concepts with Anomalies. ALT (2000)
John Case, Sanjay Jain, Steffen Lange, Thomas Zeugmann
Incremental Concept Learning for Bounded Data Mining. Inf. Comput. 152 (1) (1999)
Frank Stephan, Thomas Zeugmann
On the Uniform Learnability of Approximations to Non-Recursive Functions. ALT (1999)
Rüdiger Reischuk, Thomas Zeugmann
A Complete and Tight Average-Case Analysis of Learning Monomials. STACS (1999)
Rüdiger Reischuk, Thomas Zeugmann
An Average-Case Optimal One-Variable Pattern Language Learner Electron. Colloquium Comput. Complex. 5 (69) (1998)
Peter Rossmanith, Thomas Zeugmann
Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data. ICGI (1998)
Rüdiger Reischuk, Thomas Zeugmann
Learning One-Variable Pattern Languages in Linear Average Time. COLT (1998)
Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann
Editor's Introduction. ALT (1998)
Thomas Zeugmann
Lange and Wiehagen's Pattern Language Learning Algorithm: An Average-Case Analysis with Respect to its Total Learning Time. Ann. Math. Artif. Intell. 23 (1-2) (1998)
Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann
Classifying Predicates and Languages. Int. J. Found. Comput. Sci. 8 (1) (1997)
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. ALT (1997)
Steffen Lange, Thomas Zeugmann
Set-Driven and Rearrangement-Independent Learning of Recursive Languages. Math. Syst. Theory 29 (6) (1996)
Steffen Lange, Thomas Zeugmann, Shyam Kapur
Monotonic and Dual Monotonic Language Learning. Theor. Comput. Sci. 155 (2) (1996)
Steffen Lange, Thomas Zeugmann
Incremental Learning from Positive Data. J. Comput. Syst. Sci. 53 (1) (1996)
Steffen Lange, Rolf Wiehagen, Thomas Zeugmann
Learning by Erasing. ALT (1996)
Rusins Freivalds, Thomas Zeugmann
Co-Learning of Recursive Languages from Positive Data. Ershov Memorial Conference (1996)
Rolf Wiehagen, Thomas Zeugmann
Learning and Consistency. GOSLER Final Report (1995)
Thomas Zeugmann, Steffen Lange, Shyam Kapur
Characterizations of Monotonic and Dual Monotonic Language Learning Inf. Comput. 120 (2) (1995)
Steffen Lange, Thomas Zeugmann
Trading monotonicity demands versus mind changes. EuroCOLT (1995)
William I. Gasarch, Efim B. Kinber, Mark G. Pleszkoch, Carl H. Smith, Thomas Zeugmann
Learning via Queries with Teams and Anomalies. Fundam. Informaticae 23 (1) (1995)
Klaus P. Jantke, Takeshi Shinohara, Thomas Zeugmann
Editor's Introduction. ALT (1995)
Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann
Classifying Recursive Predicates and Languages. GOSLER Final Report (1995)
Thomas Zeugmann, Steffen Lange
A Guided Tour Across the Boundaries of Learning Recursive Languages. GOSLER Final Report (1995)
Steffen Lange, Thomas Zeugmann
Set-Driven and Rearrangement-Independent Learning of Recursive Languages. AII/ALT (1994)
Thomas Zeugmann
Report on COLT 1994. SIGACT News 25 (4) (1994)
Rolf Wiehagen, Thomas Zeugmann
Ignoring data may be the only way to learn efficiently. J. Exp. Theor. Artif. Intell. 6 (1) (1994)
Thomas Zeugmann
Average Case Analysis of Pattern Language Learning Algorithms (Abstract). AII/ALT (1994)
Steffen Lange, Thomas Zeugmann
Characterization of language learning front informant under various monotonicity constraints. J. Exp. Theor. Artif. Intell. 6 (1) (1994)
Steffen Lange, Thomas Zeugmann
Language Learning in Dependence on the Space of Hypotheses. COLT (1993)
Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann
Classification of predicates and languages. EuroCOLT (1993)
Steffen Lange, Thomas Zeugmann
Language Learning with a Bounded Number of Mind Changes. STACS (1993)
Steffen Lange, Thomas Zeugmann
Learning Recursive Languages with Bounded Mind Changes. Int. J. Found. Comput. Sci. 4 (2) (1993)
Steffen Lange, Thomas Zeugmann
Types of Monotonic Language Learning and Their Characterization. COLT (1992)

Thomas Zeugmann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Zeugmann