Rolf Wiehagen - RankMe

65 papers A* 7B 9Misc 1Journal 34Unranked 14

Year	Rank	Type	Title / Venue / Authors
2008	J	`jnl`	When unlearning helps. Inf. Comput. Ganesh R. Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen
2004	J	`jnl`	Learning all subfunctions of a function. Inf. Comput. Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
2004	J	`jnl`	Robust learning--rich and poor. J. Comput. Syst. Sci. John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen
2003	A*	`conf`	Learning All Subfunctions of a Function. COLT Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
2003	J	`jnl`	On learning of functions refutably. Theor. Comput. Sci. Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann
2003	J	`jnl`	On the intrinsic complexity of learning recursive functions. Inf. Comput. Sanjay Jain, Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen
2002	J	`jnl`	Learning by the Process of Elimination. Inf. Comput. Rusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen
2001	J	`jnl`	Foreword. Theor. Comput. Sci. Rolf Wiehagen, Thomas Zeugmann
2001	J	`jnl`	Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations. J. Comput. Syst. Sci. Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
2001	B	`conf`	Learning Recursive Functions Refutably. ALT Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann
2001	J	`jnl`	On the role of search for learning from examples. J. Exp. Theor. Artif. Intell. Stuart A. Kurtz, Carl H. Smith, Rolf Wiehagen
2001	—	`conf`	Robust Learning - Rich and Poor. COLT/EuroCOLT John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen
2001	J	`jnl`	Robust Learning Is Rich. J. Comput. Syst. Sci. Sanjay Jain, Carl H. Smith, Rolf Wiehagen
2000	A*	`conf`	Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations. COLT Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
2000	J	`jnl`	Learning languages and functions by erasing. Theor. Comput. Sci. Sanjay Jain, Efim B. Kinber, Steffen Lange, Rolf Wiehagen, Thomas Zeugmann
1999	A*	`conf`	On the Intrinsic Complexity of Learning Recursive Functions. COLT Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen
1998	B	`ed.`	Algorithmic Learning Theory, 9th International Conference, ALT '98, Otzenhausen, Germany, October 8-10, 1998, Proceedings ALT Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann
1998	B	`conf`	Editor's Introduction. ALT Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann
1998	J	`jnl`	Identifying Nearly Minimal Gödel Numbers from Additional Information. Ann. Math. Artif. Intell. Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen
1998	J	`jnl`	Learning Recursive Languages from Good Examples. Ann. Math. Artif. Intell. Steffen Lange, Jochen Nessel, Rolf Wiehagen
1998	A*	`conf`	On the Power of Learning Robustly. COLT Sanjay Jain, Carl H. Smith, Rolf Wiehagen
1997	J	`jnl`	Classifying Predicates and Languages. Int. J. Found. Comput. Sci. Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann
1997	Misc	`conf`	Learning Small Programs with Additional Information. LFCS Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith
1996	B	`conf`	Learning by Erasing. ALT Steffen Lange, Rolf Wiehagen, Thomas Zeugmann
1996	B	`conf`	On Learning and Co-learning of Minimal Programs. ALT Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
1995	—	`conf`	Classifying Recursive Predicates and Languages. GOSLER Final Report Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann
1995	—	`conf`	Error Detecting in Inductive Inference. GOSLER Final Report Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1995	J	`jnl`	Generalization versus classification. J. Exp. Theor. Artif. Intell. Rolf Wiehagen, Carl H. Smith
1995	J	`jnl`	How Inductive Inference Strategies Discover Their Errors Inf. Comput. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1995	—	`conf`	Learning and Consistency. GOSLER Final Report Rolf Wiehagen, Thomas Zeugmann
1995	—	`conf`	Learning from Good Examples. GOSLER Final Report Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1995	J	`jnl`	On Learning Multiple Concepts in Parallel. J. Comput. Syst. Sci. Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen
1994	J	`jnl`	From Inductive Inference to Algorithmic Learning Theory (Invented). New Gener. Comput. Rolf Wiehagen
1994	—	`conf`	Identifying Nearly Minimal Gödel Numbers From Additional Information. AII/ALT Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen
1994	J	`jnl`	Ignoring data may be the only way to learn efficiently. J. Exp. Theor. Artif. Intell. Rolf Wiehagen, Thomas Zeugmann
1994	—	`conf`	Language Learning from Good Examples. AII/ALT Steffen Lange, Jochen Nessel, Rolf Wiehagen
1993	—	`conf`	Classification of predicates and languages. EuroCOLT Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann
1993	A*	`conf`	On Learning Multiple Concepts in Parallel. COLT Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen
1993	J	`jnl`	On the Power of Inductive Inference from Good Examples. Theor. Comput. Sci. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1992	B	`conf`	From Inductive Inference to Algorithmic Learning Theory. ALT Rolf Wiehagen
1992	A*	`conf`	Generalization versus Classification. COLT Rolf Wiehagen, Carl H. Smith
1992	—	`conf`	Too Much Can be Too Much for Learning Efficiently. AII Rolf Wiehagen, Thomas Zeugmann
1991	—	`conf`	Dual Types of Hypotheses in Inductive Inference. Nonmonotonic and Inductive Logic Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1991	J	`jnl`	Polynomial-time Inference of Arbitrary Pattern Languages. New Gener. Comput. Steffen Lange, Rolf Wiehagen
1990	—	`conf`	A Thesis in Inductive Inference. Nonmonotonic and Inductive Logic Rolf Wiehagen
1990	B	`conf`	Polynomial-Time Inference of Pattern Languages. ALT Steffen Lange, Rolf Wiehagen
1989	—	`conf`	Inductive Inference from Good Examples. AII Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1989	J	`jnl`	On the Power of Probabilistic Inductive Inference in Nonstandard Numberings. J. Inf. Process. Cybern. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1988	J	`jnl`	Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings. Math. Log. Q. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1986	—	`conf`	On the Complexity of Effective Program Synthesis. AII Rolf Wiehagen
1986	J	`jnl`	On the Complexity of Program Synthesis from Examples. J. Inf. Process. Cybern. Rolf Wiehagen
1985	—	`conf`	How fast is program synthesis from examples. Mathematical Methods of Specification and Synthesis of Software Systems Rolf Wiehagen
1984	J	`jnl`	Connections between Identifying Functionals, standardizing Operations, and Computable Numberings. Math. Log. Q. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1984	J	`jnl`	On the Power of Probabilistic Strategies in Inductive Inference. Theor. Comput. Sci. Rolf Wiehagen, Rusins Freivalds, Efim B. Kinber
1982	J	`jnl`	Inductive Inference and Computable One-One Numberings. Math. Log. Q. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1980	J	`jnl`	Research in the theory of inductive inference by GDR mathematicians - A survey. Inf. Sci. Reinhard Klette, Rolf Wiehagen
1979	J	`jnl`	Inductive Inference with Additional Information. J. Inf. Process. Cybern. R. V. Freivald, Rolf Wiehagen
1978	A*	`conf`	Characterization Problems in the Theory of Inductive Inference. ICALP Rolf Wiehagen
1977	B	`conf`	Identification of Formal Languages. MFCS Rolf Wiehagen
1977	J	`jnl`	Rekursionstheoretische Charakterisierung von erkennbaren Klassen rekursiver Funktionen. J. Inf. Process. Cybern. Rolf Wiehagen, Hermann Jung
1976	J	`jnl`	Charakteristische Eigenschaften von erkennbaren Klassen rekursiver Funktionen. J. Inf. Process. Cybern. Rolf Wiehagen, Walter Liepe
1976	J	`jnl`	Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. J. Inf. Process. Cybern. Rolf Wiehagen
1975	J	`jnl`	Dechiffrierung von ND-Automaten. J. Inf. Process. Cybern. Rolf Wiehagen
1975	B	`conf`	Inductive Inference of Recursive Functions. MFCS Rolf Wiehagen
1975	J	`jnl`	Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. J. Inf. Process. Cybern. Rolf Wiehagen