default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKalvis Apsitis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j4]Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
Hierarchies of probabilistic and team FIN-learning. Theor. Comput. Sci. 261(1): 91-117 (2001)- [j3]Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs
:
Closedness properties in ex-identification. Theor. Comput. Sci. 268(2): 367-393 (2001)
1990 – 1999
- 1999
- [j2]Kalvis Apsitis, Setsuo Arikawa, Rusins Freivalds, Eiju Hirowatari, Carl H. Smith:
On the Inductive Inference of Recursive Real-Valued Functions. Theor. Comput. Sci. 219(1-2): 3-17 (1999) - 1998
- [c12]Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs:
Closedness Properties in EX-Identification of Recursive Functions. ALT 1998: 46-60 - 1997
- [c11]Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith:
Team Learning as a Game. ALT 1997: 2-17 - [c10]Andris Ambainis, Kalvis Apsitis, Cristian Calude, Rusins Freivalds, Marek Karpinski, Tomas Larfeldt, Iveta Sala, Juris Smotrovs:
Effects of Kolmogorov Complexity Present in Inductive Inference as Well. ALT 1997: 244-259 - [c9]Dainis Geidmanis, Janis Kaneps, Kalvis Apsitis, Daina Taimina, Elena Calude:
Tally Languages Accepted by Alternating Multitape Finite Automata. COCOON 1997: 422-430 - [c8]Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
Asymmetric Team Learning. COLT 1997: 90-95 - 1996
- [j1]Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
On Duality in Learning and the Selection of Learning Terms. Inf. Comput. 129(1): 53-62 (1996) - [c7]Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs:
Unions of identifiable families of languages. ICGI 1996: 48-58 - 1995
- [c6]Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
On the Inductive Inference of Real Valued Functions. COLT 1995: 170-177 - [c5]Kalvis Apsitis:
Topological Considerations in Composing Teams of Learning Machines. GOSLER Final Report 1995: 146-154 - 1994
- [c4]Kalvis Apsitis:
Derived Sets and Inductive Inference. AII/ALT 1994: 26-39 - [c3]Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
Choosing a learning team: a topological approach. STOC 1994: 283-289 - 1993
- [c2]Janis Barzdins, Guntis Barzdins, Kalvis Apsitis, Ugis Sarkans:
Towards Efficient Inductive Synthesis of Expressions from Input/Output Examples. ALT 1993: 59-72 - 1992
- [c1]Kalvis Apsitis, Rusins Freivalds, Martins Krikis, Raimonds Simanovskis, Juris Smotrovs:
Unions of Identifiable Classes of Total Recursive Functions. AII 1992: 99-107
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-25 05:43 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:
