default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVadim Weinstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Steven M. LaValle, Evan G. Center
, Timo Ojala, Matti Pouke, Nicoletta Prencipe, Basak Sakcak, Markku Suomalainen, Kalle G. Timperi, Vadim Weinstein:
From Virtual Reality to the Emerging Discipline of Perception Engineering. Annu. Rev. Control. Robotics Auton. Syst. 7(1) (2024)- [j9]Basak Sakcak, Kalle G. Timperi, Vadim Weinstein, Steven M. LaValle:
A mathematical characterization of minimally sufficient robot brains. Int. J. Robotics Res. 43(9): 1342-1362 (2024) - [i7]Vadim K. Weinstein, Steven M. LaValle:
Equivalent Environments and Covering Spaces for Robots. CoRR abs/2402.18323 (2024) - [i6]Steven M. LaValle, Evan G. Center, Timo Ojala, Matti Pouke, Nicoletta Prencipe, Basak Sakcak, Markku Suomalainen, Kalle G. Timperi, Vadim K. Weinstein:
From Virtual Reality to the Emerging Discipline of Perception Engineering. CoRR abs/2403.18588 (2024) - [i5]Vadim K. Weinstein, Tamara Alshammari, Kalle G. Timperi, Mehdi Bennis, Steven M. LaValle:
An Internal Model Principle For Robots. CoRR abs/2406.11237 (2024) - 2023
- [i4]Basak Sakcak, Kalle G. Timperi, Vadim Weinstein, Steven M. LaValle:
A Mathematical Characterization of Minimally Sufficient Robot Brains. CoRR abs/2308.09041 (2023) - 2022
- [j8]Vadim Weinstein, Basak Sakcak, Steven M. LaValle:
An enactivist-inspired mathematical model of cognition. Frontiers Neurorobotics 16 (2022) - [c2]Basak Sakcak, Vadim Weinstein, Steven M. LaValle:
The Limits of Learning and Planning: Minimal Sufficient Information Transition Systems. WAFR 2022: 256-272 - [i3]Vadim Weinstein, Basak Sakcak, Steven M. LaValle:
An Enactivist-Inspired Mathematical Model of Cognition. CoRR abs/2206.06096 (2022) - [i2]Basak Sakcak, Vadim Weinstein, Steven M. LaValle:
The Limits of Learning and Planning: Minimal Sufficient Information Transition Systems. CoRR abs/2212.00523 (2022) - 2020
- [j7]Vadim Kulikov:
Preferential Engagement and What Can We Learn from Online Chess? Minds Mach. 30(4): 617-636 (2020)
2010 – 2019
- 2019
- [j6]David Asperó, Tapani Hyttinen, Vadim Kulikov, Miguel Moreno:
Reducibility of Equivalence Relations Arising from Nonstationary Ideals under Large Cardinal Assumptions. Notre Dame J. Formal Log. 60(4): 665-682 (2019) - [c1]Miika Hannula, Åsa Hirvonen, Juha Kontinen, Vadim Kulikov, Jonni Virtema:
Facets of Distribution Identities in Probabilistic Team Semantics. JELIA 2019: 304-320 - 2018
- [i1]Miika Hannula, Åsa Hirvonen, Juha Kontinen, Vadim Kulikov, Jonni Virtema:
Facets of Distribution Identities in Probabilistic Team Semantics. CoRR abs/1812.05873 (2018) - 2017
- [j5]Tapani Hyttinen, Vadim Kulikov, Miguel Moreno:
A generalized Borel-reducibility counterpart of Shelah's main gap theorem. Arch. Math. Log. 56(3-4): 175-185 (2017) - 2016
- [j4]Sy-David Friedman, Yurii Khomskii, Vadim Kulikov:
Regularity properties on the generalized reals. Ann. Pure Appl. Log. 167(4): 408-430 (2016) - 2015
- [j3]Sy-David Friedman, Vadim Kulikov:
Failures of the Silver Dichotomy in the generalized Baire Space. J. Symb. Log. 80(2): 661-670 (2015) - [j2]Tapani Hyttinen, Vadim Kulikov:
On Σ11-complete equivalence relations on the generalized Baire space. Math. Log. Q. 61(1-2): 66-81 (2015) - 2013
- [j1]Vadim Kulikov:
Borel reductions and cub games in generalised descriptive set theory. J. Symb. Log. 78(2): 439-458 (2013)
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-10-16 21:22 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:
