Inductive Inference of Recursive Functions. - Rolf Wiehagen (MFCS, 1975)

Dechiffrierung von ND-Automaten. - Rolf Wiehagen (J. Inf. Process. Cybern., 1975)

Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. - Rolf Wiehagen (J. Inf. Process. Cybern., 1975)

Charakteristische Eigenschaften von erkennbaren Klassen rekursiver Funktionen. - Rolf Wiehagen; Walter Liepe (J. Inf. Process. Cybern., 1976)

Identification of Formal Languages. - Rolf Wiehagen (MFCS, 1977)

Rekursionstheoretische Charakterisierung von erkennbaren Klassen rekursiver Funktionen. - Rolf Wiehagen; Hermann Jung 001 (J. Inf. Process. Cybern., 1977)

Characterization Problems in the Theory of Inductive Inference. - Rolf Wiehagen (ICALP, 1978)

Inductive Inference with Additional Information. - R. V. Freivald; Rolf Wiehagen (J. Inf. Process. Cybern., 1979)

Research in the theory of inductive inference by GDR mathematicians - A survey. - Reinhard Klette; Rolf Wiehagen (Inf. Sci., 1980)

Inductive Inference and Computable One-One Numberings. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (Math. Log. Q., 1982)

Connections between Identifying Functionals, standardizing Operations, and Computable Numberings. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (Math. Log. Q., 1984)

On the Power of Probabilistic Strategies in Inductive Inference. - Rolf Wiehagen; Rusins Freivalds; Efim B. Kinber (Theor. Comput. Sci., 1984)

How fast is program synthesis from examples. - Rolf Wiehagen (Mathematical Methods of Specification and Synthesis of Software Systems, 1985)

On the Complexity of Effective Program Synthesis. - Rolf Wiehagen (AII, 1986)

On the Complexity of Program Synthesis from Examples. - Rolf Wiehagen (J. Inf. Process. Cybern., 1986)

Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (Math. Log. Q., 1988)

Inductive Inference from Good Examples. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (AII, 1989)

On the Power of Probabilistic Inductive Inference in Nonstandard Numberings. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (J. Inf. Process. Cybern., 1989)

Polynomial-Time Inference of Pattern Languages. - Steffen Lange; Rolf Wiehagen (ALT, 1990)

A Thesis in Inductive Inference. - Rolf Wiehagen (Nonmonotonic and Inductive Logic, 1990)

Dual Types of Hypotheses in Inductive Inference. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (Nonmonotonic and Inductive Logic, 1991)

Polynomial-time Inference of Arbitrary Pattern Languages. - Steffen Lange; Rolf Wiehagen (New Gener. Comput., 1991)

Too Much Can be Too Much for Learning Efficiently. - Rolf Wiehagen; Thomas Zeugmann (AII, 1992)

From Inductive Inference to Algorithmic Learning Theory. - Rolf Wiehagen (ALT, 1992)

Classification of predicates and languages. - Rolf Wiehagen; Carl H. Smith; Thomas Zeugmann (EuroCOLT, 1993)

On the Power of Inductive Inference from Good Examples. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (Theor. Comput. Sci., 1993)

Language Learning from Good Examples. - Steffen Lange; Jochen Nessel; Rolf Wiehagen (AII/ALT, 1994)

Ignoring data may be the only way to learn efficiently. - Rolf Wiehagen; Thomas Zeugmann (J. Exp. Theor. Artif. Intell., 1994)

From Inductive Inference to Algorithmic Learning Theory (Invented). - Rolf Wiehagen (New Gener. Comput., 1994)

Error Detecting in Inductive Inference. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (GOSLER Final Report, 1995)

Learning from Good Examples. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (GOSLER Final Report, 1995)

Classifying Recursive Predicates and Languages. - Rolf Wiehagen; Carl H. Smith; Thomas Zeugmann (GOSLER Final Report, 1995)

Learning and Consistency. - Rolf Wiehagen; Thomas Zeugmann (GOSLER Final Report, 1995)

On Learning Multiple Concepts in Parallel. - Efim B. Kinber; Carl H. Smith; Mahendran Velauthapillai; Rolf Wiehagen (J. Comput. Syst. Sci., 1995)

Generalization versus classification. - Rolf Wiehagen; Carl H. Smith (J. Exp. Theor. Artif. Intell., 1995)

How Inductive Inference Strategies Discover Their Errors - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (Inf. Comput., 1995)

On Learning and Co-learning of Minimal Programs. - Sanjay Jain 001; Efim B. Kinber; Rolf Wiehagen (ALT, 1996)

Learning by Erasing. - Steffen Lange; Rolf Wiehagen; Thomas Zeugmann (ALT, 1996)

Learning Small Programs with Additional Information. - Rusins Freivalds; Gints Tervits; Rolf Wiehagen; Carl H. Smith (LFCS, 1997)

Classifying Predicates and Languages. - Carl H. Smith; Rolf Wiehagen; Thomas Zeugmann (Int. J. Found. Comput. Sci., 1997)

Editor's Introduction. - Michael M. Richter; Carl H. Smith; Rolf Wiehagen; Thomas Zeugmann (ALT, 1998)

On the Power of Learning Robustly. - Sanjay Jain 001; Carl H. Smith; Rolf Wiehagen (COLT, 1998)

Identifying Nearly Minimal Gödel Numbers from Additional Information. - Rusins Freivalds; Ognian Botuscharov; Rolf Wiehagen (Ann. Math. Artif. Intell., 1998)

Learning Recursive Languages from Good Examples. - Steffen Lange; Jochen Nessel; Rolf Wiehagen (Ann. Math. Artif. Intell., 1998)

On the Intrinsic Complexity of Learning Recursive Functions. - Efim B. Kinber; Christophe Papazian; Carl H. Smith; Rolf Wiehagen (COLT, 1999)

Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations. - Sanjay Jain 001; Efim B. Kinber; Rolf Wiehagen (COLT, 2000)

Learning languages and functions by erasing. - Sanjay Jain 001; Efim B. Kinber; Steffen Lange; Rolf Wiehagen; Thomas Zeugmann (Theor. Comput. Sci., 2000)

Learning Recursive Functions Refutably. - Sanjay Jain 001; Efim B. Kinber; Rolf Wiehagen; Thomas Zeugmann (ALT, 2001)

Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations. - Sanjay Jain 001; Efim B. Kinber; Rolf Wiehagen (J. Comput. Syst. Sci., 2001)

Robust Learning Is Rich. - Sanjay Jain 001; Carl H. Smith; Rolf Wiehagen (J. Comput. Syst. Sci., 2001)

On the role of search for learning from examples. - Stuart A. Kurtz; Carl H. Smith; Rolf Wiehagen (J. Exp. Theor. Artif. Intell., 2001)

Foreword. - Rolf Wiehagen; Thomas Zeugmann (Theor. Comput. Sci., 2001)

Learning by the Process of Elimination. - Rusins Freivalds; Marek Karpinski; Carl H. Smith; Rolf Wiehagen (Inf. Comput., 2002)

On the intrinsic complexity of learning recursive functions. - Sanjay Jain 001; Efim B. Kinber; Christophe Papazian; Carl H. Smith; Rolf Wiehagen (Inf. Comput., 2003)

On learning of functions refutably. - Sanjay Jain 001; Efim B. Kinber; Rolf Wiehagen; Thomas Zeugmann (Theor. Comput. Sci., 2003)

Learning all subfunctions of a function. - Sanjay Jain 001; Efim B. Kinber; Rolf Wiehagen (Inf. Comput., 2004)

Robust learning–rich and poor. - John Case; Sanjay Jain 001; Frank Stephan 001; Rolf Wiehagen (J. Comput. Syst. Sci., 2004)

When unlearning helps. - Ganesh R. Baliga; John Case; Wolfgang Merkle; Frank Stephan 001; Rolf Wiehagen (Inf. Comput., 2008)