| 2009 | ||
|---|---|---|
| 82 | Sanjay Jain, Efim B. Kinber: Iterative Learning from Texts and Counterexamples Using Additional Information. ALT 2009: 308-322 | |
| 81 | Sanjay Jain, Efim B. Kinber: One-shot learners using negative counterexamples and nearest positive examples. Theor. Comput. Sci. 410(27-29): 2562-2580 (2009) | |
| 2008 | ||
| 80 | Efim B. Kinber: On Learning Regular Expressions and Patterns Via Membership and Correction Queries. ICGI 2008: 125-138 | |
| 79 | Sanjay Jain, Efim B. Kinber: Learning languages from positive data and negative counterexamples. J. Comput. Syst. Sci. 74(4): 431-456 (2008) | |
| 78 | Sanjay Jain, Efim B. Kinber: Learning and extending sublanguages. Theor. Comput. Sci. 397(1-3): 233-246 (2008) | |
| 2007 | ||
| 77 | Sanjay Jain, Efim B. Kinber: One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples. ALT 2007: 257-271 | |
| 76 | Sanjay Jain, Efim B. Kinber: Iterative learning from positive data and negative counterexamples. Inf. Comput. 205(12): 1777-1805 (2007) | |
| 75 | Sanjay Jain, Efim B. Kinber: Learning multiple languages in groups. Theor. Comput. Sci. 387(1): 67-76 (2007) | |
| 74 | Sanjay Jain, Efim B. Kinber: Learning languages from positive data and a limited number of short counterexamples. Theor. Comput. Sci. 389(1-2): 190-218 (2007) | |
| 2006 | ||
| 73 | Sanjay Jain, Efim B. Kinber: Learning and Extending Sublanguages. ALT 2006: 139-153 | |
| 72 | Sanjay Jain, Efim B. Kinber: Iterative Learning from Positive Data and Negative Counterexamples. ALT 2006: 154-168 | |
| 71 | Sanjay Jain, Efim B. Kinber: On Learning Languages from Positive Data and a Limited Number of Short Counterexamples. COLT 2006: 259-273 | |
| 70 | Sanjay Jain, Efim B. Kinber: Learning languages from positive data and a finite number of queries. Inf. Comput. 204(1): 123-175 (2006) | |
| 69 | Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan: Variations on U-shaped learning. Inf. Comput. 204(8): 1264-1294 (2006) | |
| 2005 | ||
| 68 | Sanjay Jain, Efim B. Kinber: Learning Multiple Languages in Groups. ALT 2005: 256-268 | |
| 67 | Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan: Variations on U-Shaped Learning. COLT 2005: 382-397 | |
| 2004 | ||
| 66 | Sanjay Jain, Efim B. Kinber: Learning Languages from Positive Data and Negative Counterexamples. ALT 2004: 54-68 | |
| 65 | Sanjay Jain, Efim B. Kinber: Learning Languages from Positive Data and a Finite Number of Queries. FSTTCS 2004: 360-371 | |
| 64 | John Case, Efim B. Kinber, Arun Sharma, Frank Stephan: On the classification of recursive languages. Inf. Comput. 192(1): 15-40 (2004) | |
| 63 | Sanjay Jain, Efim B. Kinber, Rolf Wiehagen: Learning all subfunctions of a function. Inf. Comput. 192(2): 185-215 (2004) | |
| 2003 | ||
| 62 | Sanjay Jain, Efim B. Kinber, Rolf Wiehagen: Learning All Subfunctions of a Function. COLT 2003: 714-728 | |
| 61 | 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) | |
| 60 | Sanjay Jain, Efim B. Kinber: Intrinsic complexity of learning geometrical concepts from positive data. J. Comput. Syst. Sci. 67(3): 546-607 (2003) | |
| 59 | Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann: On learning of functions refutably. Theor. Comput. Sci. 1(298): 111-143 (2003) | |
| 2001 | ||
| 58 | Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann: Learning Recursive Functions Refutably. ALT 2001: 283-298 | |
| 57 | Sanjay Jain, Efim B. Kinber: Intrinsic Complexity of Learning Geometrical Concepts from Positive Data. COLT/EuroCOLT 2001: 177-193 | |
| 56 | 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) | |
| 2000 | ||
| 55 | Sanjay Jain, Efim B. Kinber, Rolf Wiehagen: Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations. COLT 2000: 47-58 | |
| 54 | 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) | |
| 1999 | ||
| 53 | Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen: On the Intrinsic Complexity of Learning Recursive Functions. COLT 1999: 257-266 | |
| 52 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith: The functions of finite support: a canonical learning problem. J. Exp. Theor. Artif. Intell. 11(4): 543-552 (1999) | |
| 1997 | ||
| 51 | John Case, Efim B. Kinber, Arun Sharma, Frank Stephan: On the Classification of Computable Languages. STACS 1997: 225-236 | |
| 50 | John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer: Learning Recursive Functions from Approximations. J. Comput. Syst. Sci. 55(1): 183-196 (1997) | |
| 1996 | ||
| 49 | Sanjay Jain, Efim B. Kinber, Rolf Wiehagen: On Learning and Co-learning of Minimal Programs. ALT 1996: 242-255 | |
| 48 | Richard Beigel, William I. Gasarch, Efim B. Kinber: Frequency Computation and Bounded Queries. Theor. Comput. Sci. 163(1&2): 177-192 (1996) | |
| 1995 | ||
| 47 | Efim B. Kinber, Frank Stephan: Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity (Extended Abstract). COLT 1995: 182-189 | |
| 46 | John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer: Learning recursive functions from approximations. EuroCOLT 1995: 140-153 | |
| 45 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith: On the intrinsic complexity of learning. EuroCOLT 1995: 154-168 | |
| 44 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith: Probabilistic versus Deterministic Memory Limited Learning. GOSLER Final Report 1995: 155-161 | |
| 43 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen: Error Detecting in Inductive Inference. GOSLER Final Report 1995: 25-48 | |
| 42 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen: Learning from Good Examples. GOSLER Final Report 1995: 49-62 | |
| 41 | Richard Beigel, William I. Gasarch, Efim B. Kinber: Frequency Computation and Bounded Queries. Structure in Complexity Theory Conference 1995: 125-132 | |
| 40 | Richard Beigel, William I. Gasarch, Efim B. Kinber: Frequency Computation and Bounded Queries Electronic Colloquium on Computational Complexity (ECCC) 2(36): (1995) | |
| 39 | William I. Gasarch, Efim B. Kinber, Mark G. Pleszkoch, Carl H. Smith, Thomas Zeugmann: Learning via Queries with Teams and Anomalies. Fundam. Inform. 23(1): 67-89 (1995) | |
| 38 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen: How Inductive Inference Strategies Discover Their Errors Inf. Comput. 118(2): 208-226 (1995) | |
| 37 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith: On the Intrinsic Complexity of Learning. Inf. Comput. 123(1): 64-71 (1995) | |
| 36 | Efim B. Kinber, Frank Stephan: Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity. Inf. Comput. 123(2): 224-241 (1995) | |
| 35 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith: On the Impact of Forgetting on Learning Machines. J. ACM 42(6): 1146-1168 (1995) | |
| 34 | 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) | |
| 1994 | ||
| 33 | Efim B. Kinber: Monotonicity versus Efficiency for Learning Languages from Texts. AII/ALT 1994: 395-406 | |
| 32 | Lance Fortnow, William I. Gasarch, Sanjay Jain, Efim B. Kinber, Martin Kummer, Stuart A. Kurtz, Mark Pleszkovich, Theodore A. Slaman, Robert Solovay, Frank Stephan: Extremes in the Degrees of Inferability. Ann. Pure Appl. Logic 66(3): 231-276 (1994) | |
| 1993 | ||
| 31 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith: On the Impact of Forgetting on Learning Machines. COLT 1993: 165-174 | |
| 30 | Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen: On Learning Multiple Concepts in Parallel. COLT 1993: 175-181 | |
| 29 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith: On the impact of forgetting on learing machines. Bulletin of the EATCS 49: 212-225 (1993) | |
| 28 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith: On the impact of forgetting on learing machines. Bulletin of the EATCS 51: 212-225 (1993) | |
| 27 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen: On the Power of Inductive Inference from Good Examples. Theor. Comput. Sci. 110(1): 131-144 (1993) | |
| 1992 | ||
| 26 | Efim B. Kinber: Learning A Class of Regular Expressions via Restricted Subset Queries. AII 1992: 232-243 | |
| 25 | Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman: Degrees of Inferability. COLT 1992: 180-192 | |
| 1991 | ||
| 24 | Efim B. Kinber: Some Models of Inductive Syntactical Synthesis from Sample Computations. Baltic Computer Science 1991: 213-252 | |
| 23 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen: Dual Types of Hypotheses in Inductive Inference. Nonmonotonic and Inductive Logic 1991: 209-240 | |
| 22 | Efim B. Kinber, Thomas Zeugmann: One-Sided Error Probabilistic Inductive Inference and Reliable Frequency Identification Inf. Comput. 92(2): 253-284 (1991) | |
| 21 | Efim B. Kinber: On Complete Sets of Samples for Generalized Regular Expressions. Theor. Comput. Sci. 91(1): 101-117 (1991) | |
| 1990 | ||
| 20 | Efim B. Kinber: Some Problems of Learning with an Oracle. COLT 1990: 178-186 | |
| 19 | Efim B. Kinber, William I. Gasarch, Thomas Zeugmann, Mark G. Pleszkoch, Carl H. Smith: Learning Via Queries With Teams and Anomilies. COLT 1990: 327-337 | |
| 18 | Efim B. Kinber, Alvis Brazma: Models of Inductive Synthesis. J. Log. Program. 9(2&3): 221-233 (1990) | |
| 1989 | ||
| 17 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen: Inductive Inference from Good Examples. AII 1989: 1-17 | |
| 16 | Efim B. Kinber, Thomas Zeugmann: Refined Query Inference (Extended Abstract). AII 1989: 148-160 | |
| 15 | Efim B. Kinber, Thomas Zeugmann: Monte-Carlo Inference and Its Relations to Reliable Frequency Identification. FCT 1989: 257-266 | |
| 14 | 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) | |
| 13 | Efim B. Kinber: Inductive Synthesis of Programs for Recursive Functions from Sample Computations. Elektronische Informationsverarbeitung und Kybernetik 25(8/9): 435-456 (1989) | |
| 1988 | ||
| 12 | Efim B. Kinber: Inductive Syntactical Synthesis of Programs from Sample Computations. MFCS 1988: 73-84 | |
| 11 | Efim B. Kinber: Inductive Synthesis of Algorithms for Graphs from Sample Computations. Elektronische Informationsverarbeitung und Kybernetik 24(4/5): 201-218 (1988) | |
| 1986 | ||
| 10 | Efim B. Kinber, Arto Salomaa, Sheng Yu: On the equivalence of grammars inferred from derivation. Bulletin of the EATCS 29: 39-45 (1986) | |
| 9 | Alvis Brazma, Efim B. Kinber: Generalized Regular Expressions-A Language for Synthesis of Programs with Braching in Loops. Theor. Comput. Sci. 46(3): 175-195 (1986) | |
| 1985 | ||
| 8 | Efim B. Kinber, Thomas Zeugmann: Inductive Inference of Almost Everywhere Correct Programs by Reliably Working Strategies. Elektronische Informationsverarbeitung und Kybernetik 21(3): 91-100 (1985) | |
| 7 | Andrejs J. Auzins, Efim B. Kinber: On Separation of the Emptiness and Equivalence Problems for Program Schemes. Inf. Process. Lett. 20(2): 91-93 (1985) | |
| 6 | Efim B. Kinber: Three-way automata on rectangular tapes over a one-letter alphabet. Inf. Sci. 35(1): 61-77 (1985) | |
| 1984 | ||
| 5 | Rolf Wiehagen, Rusins Freivalds, Efim B. Kinber: On the Power of Probabilistic Strategies in Inductive Inference. Theor. Comput. Sci. 28: 111-133 (1984) | |
| 1983 | ||
| 4 | Efim B. Kinber: A Note on Limit Identification of c-minimal Indices. Elektronische Informationsverarbeitung und Kybernetik 19(9): 459-463 (1983) | |
| 3 | Efim B. Kinber: The Inclusion Problem for some Classes of Deterministic Multitape Automata. Theor. Comput. Sci. 26: 1-24 (1983) | |
| 1980 | ||
| 2 | Efim B. Kinber: On Inclusion Problem for Deterministic Multitape Automata. Inf. Process. Lett. 11(3): 144-146 (1980) | |
| 1977 | ||
| 1 | Efim B. Kinber: On a Theory of Inductive Inference. FCT 1977: 435-440 | |