default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEfim B. Kinber
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[j52]Sanjay Jain
, Efim B. Kinber:
Intrinsic complexity of partial learning. Theor. Comput. Sci. 776: 43-63 (2019)- 2017
- [j51]Sanjay Jain, Efim B. Kinber, Frank Stephan:
Automatic learning from positive data and negative counterexamples. Inf. Comput. 255: 45-67 (2017) - 2016
- [j50]Efim B. Kinber:
To the Memory of R. Freivalds. Balt. J. Mod. Comput. 4(4): 677-682 (2016) - [j49]Sanjay Jain, Efim B. Kinber:
Parallel learning of automatic classes of languages. Theor. Comput. Sci. 650: 25-44 (2016) - [c44]Sanjay Jain, Efim B. Kinber:
Intrinsic Complexity of Partial Learning. ALT 2016: 174-188 - 2014
- [c43]Sanjay Jain, Efim B. Kinber:
Parallel Learning of Automatic Classes of Languages. ALT 2014: 70-84 - [c42]Sanjay Jain, Efim B. Kinber:
Learning from Positive Data and Negative Counterexamples: A Survey. Computing with New Resources 2014: 323-337 - 2013
- [j48]Sanjay Jain, Efim B. Kinber:
Mind change speed-up for learning languages from positive data. Theor. Comput. Sci. 489-490: 37-47 (2013) - 2012
- [c41]Sanjay Jain, Efim B. Kinber:
Automatic Learning from Positive Data and Negative Counterexamples. ALT 2012: 66-80 - [c40]Sanjay Jain, Efim B. Kinber:
Mind Change Speed-up for Learning Languages from Positive Data. STACS 2012: 350-361 - 2011
- [j47]Sanjay Jain, Efim B. Kinber:
Iterative learning from texts and counterexamples using additional information. Mach. Learn. 84(3): 291-333 (2011) - 2010
- [c39]Sanjay Jain, Efim B. Kinber:
Inductive Inference of Languages from Samplings. ALT 2010: 330-344 - [c38]Efim B. Kinber:
Learning Regular Expressions from Representative Examples and Membership Queries. ICGI 2010: 94-108
2000 – 2009
- 2009
- [j46]Sanjay Jain, Efim B. Kinber:
One-shot learners using negative counterexamples and nearest positive examples. Theor. Comput. Sci. 410(27-29): 2562-2580 (2009) - [c37]Sanjay Jain, Efim B. Kinber:
Iterative Learning from Texts and Counterexamples Using Additional Information. ALT 2009: 308-322 - 2008
- [j45]Sanjay Jain, Efim B. Kinber:
Learning languages from positive data and negative counterexamples. J. Comput. Syst. Sci. 74(4): 431-456 (2008) - [j44]Sanjay Jain, Efim B. Kinber:
Learning and extending sublanguages. Theor. Comput. Sci. 397(1-3): 233-246 (2008) - [c36]Efim B. Kinber:
On Learning Regular Expressions and Patterns Via Membership and Correction Queries. ICGI 2008: 125-138 - 2007
- [j43]Sanjay Jain, Efim B. Kinber:
Iterative learning from positive data and negative counterexamples. Inf. Comput. 205(12): 1777-1805 (2007) - [j42]Sanjay Jain, Efim B. Kinber:
Learning multiple languages in groups. Theor. Comput. Sci. 387(1): 67-76 (2007) - [j41]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) - [c35]Sanjay Jain, Efim B. Kinber:
One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples. ALT 2007: 257-271 - 2006
- [j40]Sanjay Jain, Efim B. Kinber:
Learning languages from positive data and a finite number of queries. Inf. Comput. 204(1): 123-175 (2006) - [j39]Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan:
Variations on U-shaped learning. Inf. Comput. 204(8): 1264-1294 (2006) - [c34]Sanjay Jain, Efim B. Kinber:
Learning and Extending Sublanguages. ALT 2006: 139-153 - [c33]Sanjay Jain, Efim B. Kinber:
Iterative Learning from Positive Data and Negative Counterexamples. ALT 2006: 154-168 - [c32]Sanjay Jain, Efim B. Kinber:
On Learning Languages from Positive Data and a Limited Number of Short Counterexamples. COLT 2006: 259-273 - 2005
- [c31]Sanjay Jain, Efim B. Kinber:
Learning Multiple Languages in Groups. ALT 2005: 256-268 - [c30]Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan:
Variations on U-Shaped Learning. COLT 2005: 382-397 - 2004
- [j38]John Case, Efim B. Kinber, Arun Sharma, Frank Stephan:
On the classification of recursive languages. Inf. Comput. 192(1): 15-40 (2004) - [j37]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen:
Learning all subfunctions of a function. Inf. Comput. 192(2): 185-215 (2004) - [c29]Sanjay Jain, Efim B. Kinber:
Learning Languages from Positive Data and Negative Counterexamples. ALT 2004: 54-68 - [c28]Sanjay Jain, Efim B. Kinber:
Learning Languages from Positive Data and a Finite Number of Queries. FSTTCS 2004: 360-371 - 2003
- [j36]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) - [j35]Sanjay Jain, Efim B. Kinber:
Intrinsic complexity of learning geometrical concepts from positive data. J. Comput. Syst. Sci. 67(3): 546-607 (2003) - [j34]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann:
On learning of functions refutably. Theor. Comput. Sci. 298(1): 111-143 (2003) - [c27]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen:
Learning All Subfunctions of a Function. COLT 2003: 714-728 - 2001
- [j33]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) - [c26]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann:
Learning Recursive Functions Refutably. ALT 2001: 283-298 - [c25]Sanjay Jain, Efim B. Kinber:
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data. COLT/EuroCOLT 2001: 177-193 - 2000
- [j32]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) - [c24]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
- [j31]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) - [c23]Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen:
On the Intrinsic Complexity of Learning Recursive Functions. COLT 1999: 257-266 - 1997
- [j30]John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer:
Learning Recursive Functions from Approximations. J. Comput. Syst. Sci. 55(1): 183-196 (1997) - [c22]John Case, Efim B. Kinber, Arun Sharma, Frank Stephan:
On the Classification of Computable Languages. STACS 1997: 225-236 - 1996
- [j29]Richard Beigel, William I. Gasarch, Efim B. Kinber:
Frequency Computation and Bounded Queries. Theor. Comput. Sci. 163(1&2): 177-192 (1996) - [c21]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen:
On Learning and Co-learning of Minimal Programs. ALT 1996: 242-255 - 1995
- [j28]William I. Gasarch, Efim B. Kinber, Mark G. Pleszkoch, Carl H. Smith, Thomas Zeugmann:
Learning via Queries with Teams and Anomalies. Fundam. Informaticae 23(1): 67-89 (1995) - [j27]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
How Inductive Inference Strategies Discover Their Errors. Inf. Comput. 118(2): 208-226 (1995) - [j26]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the Intrinsic Complexity of Learning. Inf. Comput. 123(1): 64-71 (1995) - [j25]Efim B. Kinber, Frank Stephan:
Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity. Inf. Comput. 123(2): 224-241 (1995) - [j24]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the Impact of Forgetting on Learning Machines. J. ACM 42(6): 1146-1168 (1995) - [j23]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) - [c20]Richard Beigel, William I. Gasarch, Efim B. Kinber:
Frequency Computation and Bounded Queries. SCT 1995: 125-132 - [c19]Efim B. Kinber, Frank Stephan:
Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity (Extended Abstract). COLT 1995: 182-189 - [c18]John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer:
Learning recursive functions from approximations. EuroCOLT 1995: 140-153 - [c17]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the intrinsic complexity of learning. EuroCOLT 1995: 154-168 - [c16]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Error Detecting in Inductive Inference. GOSLER Final Report 1995: 25-48 - [c15]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Learning from Good Examples. GOSLER Final Report 1995: 49-62 - [c14]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
Probabilistic versus Deterministic Memory Limited Learning. GOSLER Final Report 1995: 155-161 - [i1]Richard Beigel, William I. Gasarch, Efim B. Kinber:
Frequency Computation and Bounded Queries. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j22]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. Log. 66(3): 231-276 (1994) - [c13]Efim B. Kinber:
Monotonicity versus Efficiency for Learning Languages from Texts. AII/ALT 1994: 395-406 - 1993
- [j21]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the impact of forgetting on learing machines. Bull. EATCS 49: 212-225 (1993) - [j20]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the impact of forgetting on learing machines. Bull. EATCS 51: 212-225 (1993) - [j19]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
On the Power of Inductive Inference from Good Examples. Theor. Comput. Sci. 110(1): 131-144 (1993) - [c12]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the Impact of Forgetting on Learning Machines. COLT 1993: 165-174 - [c11]Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen:
On Learning Multiple Concepts in Parallel. COLT 1993: 175-181 - 1992
- [c10]Efim B. Kinber:
Learning A Class of Regular Expressions via Restricted Subset Queries. AII 1992: 232-243 - [c9]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
- [j18]Efim B. Kinber, Thomas Zeugmann:
One-Sided Error Probabilistic Inductive Inference and Reliable Frequency Identification. Inf. Comput. 92(2): 253-284 (1991) - [j17]Efim B. Kinber:
On Complete Sets of Samples for Generalized Regular Expressions. Theor. Comput. Sci. 91(1): 101-117 (1991) - [c8]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Dual Types of Hypotheses in Inductive Inference. Nonmonotonic and Inductive Logic 1991: 209-240 - [p1]Efim B. Kinber:
Some Models of Inductive Syntactical Synthesis from Sample Computations. Baltic Computer Science 1991: 213-252 - 1990
- [j16]Efim B. Kinber, Alvis Brazma:
Models of Inductive Synthesis. J. Log. Program. 9(2&3): 221-233 (1990) - [c7]Efim B. Kinber:
Some Problems of Learning with an Oracle. COLT 1990: 178-186 - [c6]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
1980 – 1989
- 1989
- [j15]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
On the Power of Probabilistic Inductive Inference in Nonstandard Numberings. J. Inf. Process. Cybern. 25(5/6): 239-243 (1989) - [j14]Efim B. Kinber:
Inductive Synthesis of Programs for Recursive Functions from Sample Computations. J. Inf. Process. Cybern. 25(8/9): 435-456 (1989) - [c5]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Inductive Inference from Good Examples. AII 1989: 1-17 - [c4]Efim B. Kinber, Thomas Zeugmann:
Refined Query Inference (Extended Abstract). AII 1989: 148-160 - [c3]Efim B. Kinber, Thomas Zeugmann:
Monte-Carlo Inference and Its Relations to Reliable Frequency Identification. FCT 1989: 257-266 - 1988
- [j13]Efim B. Kinber:
Inductive Synthesis of Algorithms for Graphs from Sample Computations. J. Inf. Process. Cybern. 24(4/5): 201-218 (1988) - [j12]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings. Math. Log. Q. 34(6): 531-539 (1988) - [c2]Efim B. Kinber:
Inductive Syntactical Synthesis of Programs from Sample Computations. MFCS 1988: 73-84 - 1986
- [j11]Efim B. Kinber, Arto Salomaa, Sheng Yu:
On the equivalence of grammars inferred from derivation. Bull. EATCS 29: 39-45 (1986) - [j10]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
- [j9]Efim B. Kinber, Thomas Zeugmann:
Inductive Inference of Almost Everywhere Correct Programs by Reliably Working Strategies. J. Inf. Process. Cybern. 21(3): 91-100 (1985) - [j8]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) - [j7]Efim B. Kinber:
Three-way automata on rectangular tapes over a one-letter alphabet. Inf. Sci. 35(1): 61-77 (1985) - 1984
- [j6]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Connections between Identifying Functionals, standardizing Operations, and Computable Numberings. Math. Log. Q. 30(9-11): 145-164 (1984) - [j5]Rolf Wiehagen, Rusins Freivalds, Efim B. Kinber:
On the Power of Probabilistic Strategies in Inductive Inference. Theor. Comput. Sci. 28: 111-133 (1984) - 1983
- [j4]Efim B. Kinber:
A Note on Limit Identification of c-minimal Indices. J. Inf. Process. Cybern. 19(9): 459-463 (1983) - [j3]Efim B. Kinber:
The Inclusion Problem for some Classes of Deterministic Multitape Automata. Theor. Comput. Sci. 26: 1-24 (1983) - 1982
- [j2]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Inductive Inference and Computable One-One Numberings. Math. Log. Q. 28(27-32): 463-479 (1982) - 1980
- [j1]Efim B. Kinber:
On Inclusion Problem for Deterministic Multitape Automata. Inf. Process. Lett. 11(3): 144-146 (1980)
1970 – 1979
- 1977
- [c1]Efim B. Kinber:
On a Theory of Inductive Inference. FCT 1977: 435-440
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
