The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Efim B. Kinber: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  74. Iterative Learning from Texts and Counterexamples Using Additional Information. [Citation Graph (, )][DBLP]


  75. Inductive Inference of Languages from Samplings. [Citation Graph (, )][DBLP]


  76. On Learning Regular Expressions and Patterns Via Membership and Correction Queries. [Citation Graph (, )][DBLP]


  77. Learning Regular Expressions from Representative Examples and Membership Queries. [Citation Graph (, )][DBLP]


Search in 0.025secs, Finished in 0.029secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002