Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Rolf Wiehagen
2000 – 2009
- 2008
[j30]Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen: When unlearning helps. Inf. Comput. 206(5): 694-709 (2008)- 2004
- [j29]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen: Learning all subfunctions of a function. Inf. Comput. 192(2): 185-215 (2004)
- [j28]John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen: Robust learning--rich and poor. J. Comput. Syst. Sci. 69(2): 123-165 (2004)
- 2003
- [j27]Sanjay Jain, Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen: On the intrinsic complexity of learning recursive functions. Inf. Comput. 184(1): 45-70 (2003)
- [j26]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann: On learning of functions refutably. Theor. Comput. Sci. 1(298): 111-143 (2003)
- [c29]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen: Learning All Subfunctions of a Function. COLT 2003: 714-728
- 2002
- [j25]Rusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen: Learning by the Process of Elimination. Inf. Comput. 176(1): 37-50 (2002)
- 2001
- [j24]Sanjay Jain, Carl H. Smith, Rolf Wiehagen: Robust Learning Is Rich. J. Comput. Syst. Sci. 62(1): 178-212 (2001)
- [j23]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen: Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations. J. Comput. Syst. Sci. 63(3): 305-354 (2001)
- [j22]Stuart A. Kurtz, Carl H. Smith, Rolf Wiehagen: On the role of search for learning from examples. J. Exp. Theor. Artif. Intell. 13(1): 25-43 (2001)
- [j21]
- [c28]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann: Learning Recursive Functions Refutably. ALT 2001: 283-298
- [c27]John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen: Robust Learning - Rich and Poor. COLT/EuroCOLT 2001: 143-159
- 2000
- [j20]Sanjay Jain, Efim B. Kinber, Steffen Lange, Rolf Wiehagen, Thomas Zeugmann: Learning languages and functions by erasing. Theor. Comput. Sci. 241(1-2): 143-189 (2000)
- [c26]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen: Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations. COLT 2000: 47-58
1990 – 1999
- 1999
- [c25]Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen: On the Intrinsic Complexity of Learning Recursive Functions. COLT 1999: 257-266
- 1998
- [j19]Steffen Lange, Jochen Nessel, Rolf Wiehagen: Learning Recursive Languages from Good Examples. Ann. Math. Artif. Intell. 23(1-2): 27-52 (1998)
- [j18]Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen: Identifying Nearly Minimal Gödel Numbers from Additional Information. Ann. Math. Artif. Intell. 23(1-2): 199-209 (1998)
- [c24]Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann: Editor's Introduction. ALT 1998: 1-10
- [c23]
- [e1]Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann (Eds.): Algorithmic Learning Theory, 9th International Conference, ALT '98, Otzenhausen, Germany, October 8-10, 1998, Proceedings. Lecture Notes in Computer Science 1501, Springer 1998, ISBN 3-540-65013-X
- 1997
- [j17]Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann: Classifying Predicates and Languages. Int. J. Found. Comput. Sci. 8(1): 15-42 (1997)
- [c22]Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith: Learning Small Programs with Additional Information. LFCS 1997: 102-112
- 1996
- [c21]
- [c20]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen: On Learning and Co-learning of Minimal Programs. ALT 1996: 242-255
- 1995
- [j16]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen: How Inductive Inference Strategies Discover Their Errors. Inf. Comput. 118(2): 208-226 (1995)
- [j15]Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen: On Learning Multiple Concepts in Parallel. J. Comput. Syst. Sci. 50(1): 41-52 (1995)
- [j14]Rolf Wiehagen, Carl H. Smith: Generalization versus classification. J. Exp. Theor. Artif. Intell. 7(2): 163-174 (1995)
- [c19]
- [c18]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen: Error Detecting in Inductive Inference. GOSLER Final Report 1995: 25-48
- [c17]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen: Learning from Good Examples. GOSLER Final Report 1995: 49-62
- [c16]Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann: Classifying Recursive Predicates and Languages. GOSLER Final Report 1995: 174-189
- 1994
- [j13]Rolf Wiehagen, Thomas Zeugmann: Ignoring data may be the only way to learn efficiently. J. Exp. Theor. Artif. Intell. 6(1): 131-144 (1994)
- [j12]Rolf Wiehagen: From Inductive Inference to Algorithmic Learning Theory (Invented). New Generation Comput. 12(4): 321-335 (1994)
- [c15]Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen: Identifying Nearly Minimal Gödel Numbers From Additional Information. AII/ALT 1994: 91-99
- [c14]Steffen Lange, Jochen Nessel, Rolf Wiehagen: Language Learning from Good Examples. AII/ALT 1994: 423-437
- 1993
- [j11]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen: On the Power of Inductive Inference from Good Examples. Theor. Comput. Sci. 110(1): 131-144 (1993)
- [c13]Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen: On Learning Multiple Concepts in Parallel. COLT 1993: 175-181
- 1992
- [c12]
- [c11]
- [c10]
- 1991
- [j10]Steffen Lange, Rolf Wiehagen: Polynomial-time Inference of Arbitrary Pattern Languages. New Generation Comput. 8(4): 361-370 (1991)
- [c9]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen: Dual Types of Hypotheses in Inductive Inference. Nonmonotonic and Inductive Logic 1991: 209-240
- 1990
- [c8]
- [c7]
1980 – 1989
- 1989
- [j9]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen: On the Power of Probabilistic Inductive Inference in Nonstandard Numberings. Elektronische Informationsverarbeitung und Kybernetik 25(5/6): 239-243 (1989)
- [c6]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen: Inductive Inference from Good Examples. AII 1989: 1-17
- 1986
- [j8]Rolf Wiehagen: On the Complexity of Program Synthesis from Examples. Elektronische Informationsverarbeitung und Kybernetik 22(5/6): 305-323 (1986)
- [c5]
- 1985
- [c4]Rolf Wiehagen: How fast is program synthesis from examples. Mathematical Methods of Specification and Synthesis of Software Systems 1985: 231-239
- 1984
- [j7]Rolf Wiehagen, Rusins Freivalds, Efim B. Kinber: On the Power of Probabilistic Strategies in Inductive Inference. Theor. Comput. Sci. 28: 111-133 (1984)
- 1980
- [j6]Reinhard Klette, Rolf Wiehagen: Research in the theory of inductive inference by GDR mathematicians - A survey. Inf. Sci. 22(2): 149-169 (1980)
1970 – 1979
- 1979
- [j5]R. V. Freivald, Rolf Wiehagen: Inductive Inference with Additional Information. Elektronische Informationsverarbeitung und Kybernetik 15(4): 179-185 (1979)
- 1978
- [c3]
- 1977
- [j4]Rolf Wiehagen, Hermann Jung: Rekursionstheoretische Charakterisierung von erkennbaren Klassen rekursiver Funktionen. Elektronische Informationsverarbeitung und Kybernetik 13(7/8): 385-397 (1977)
- [c2]
- 1976
- [j3]Rolf Wiehagen: Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. Elektronische Informationsverarbeitung und Kybernetik 12(1/2): 93-99 (1976)
- [j2]Rolf Wiehagen, Walter Liepe: Charakteristische Eigenschaften von erkennbaren Klassen rekursiver Funktionen. Elektronische Informationsverarbeitung und Kybernetik 12(8/9): 421-438 (1976)
- 1975
- [j1]Rolf Wiehagen: Dechiffrierung von ND-Automaten. Elektronische Informationsverarbeitung und Kybernetik 11(1/2): 39-60 (1975)
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-27 21:54 CET by the dblp team