default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Yakhnis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c7]Oleg Umanskiy, Boris Stilman, Vladimir Yakhnis, Latika Eifert, Jonathan Stevens:
Linguistic geometry for intelligent analysis of courses of action for training. SummerSim 2015: 56:1-56:10- 2012
- [c6]Oleg Umanskiy, Ron Boyd, Viacheslav Pugachev, Lance Hagen, Vladimir Yakhnis, Boris Stilman:
Industrial applications of Linguistic Geometry. ISDA 2012: 13-20 - 2011
- [j9]Boris Stilman, Vladimir Yakhnis, Oleg Umanskiy:
The Primary Language of ancient battles. Int. J. Mach. Learn. Cybern. 2(3): 157-176 (2011) - 2010
- [j8]Boris Stilman, Vladimir Yakhnis, Oleg Umanskiy:
Linguistic Geometry: The Age of Maturity. J. Adv. Comput. Intell. Intell. Informatics 14(6): 684-699 (2010) - [j7]Boris Stilman, Vladimir Yakhnis, Oleg Umanskiy, Ron Boyd, Viacheslav Pugachev, Lance Hagen:
LG-PACKAGE: New Frontier. Polibits 42: 5-12 (2010) - [c5]Boris Stilman, Vladimir Yakhnis, Oleg Umanskiy:
Discovering Role of Linguistic Geometry. MICAI (2) 2010: 1-21
2000 – 2009
- 2002
- [j6]Boris Stilman, Vladimir Yakhnis, Oleg Umanskiy:
Knowledge Acquisition and Strategy Generation with LG Wargaming Tools. Int. J. Comput. Intell. Appl. 2(4): 385-410 (2002) - 2000
- [j5]Boris Stilman, Vladimir Yakhnis, Oleg Umanskiy:
Winning strategies for robotic wars: defense applications of linguistic geometry. Artif. Life Robotics 4(3): 148-155 (2000)
1990 – 1999
- 1998
- [j4]Bakhadyr Khoussainov, Alexander Yakhnis, Vladimir Yakhnis:
Games with Unknown Past. Math. Log. Q. 44: 185-204 (1998) - [c4]Vladimir Yakhnis:
Grammar of zones with admissible trajectories of arbitrary degrees. SMC 1998: 4919-4924 - [c3]Vladimir Yakhnis:
A UML based notation for specifying abstract board games. SMC 1998: 4925-4929 - [c2]Michael Stilman, Vladimir Yakhnis:
Linguistic geometry tools for multiple agents with variable speeds. SMC 1998: 4930-4934 - 1995
- [c1]Vladimir Yakhnis, Boris Stilman:
A Multi-Agent Graph-Game Approach to Theoretical Foundations of Linguistic Geometry. WOCFAI 1995: 493-504 - 1993
- [j3]Sergei S. Goncharov, Alexander Yakhnis, Vladimir Yakhnis:
Some Effectively Infinite Classes of Enumerations. Ann. Pure Appl. Log. 60(3): 207-235 (1993) - [j2]Alexander Yakhnis, Vladimir Yakhnis:
Gurevich-Harrington's Games Defined by Finite Automata. Ann. Pure Appl. Log. 62(3): 265-294 (1993) - 1990
- [j1]Alexander Yakhnis, Vladimir Yakhnis:
Extension of Gurevich-Harrington's Restricted Memory Determinacy Theorem: A Criterion for the Winning Player and an Explicit Class of Winning Strategies. Ann. Pure Appl. Log. 48(3): 277-297 (1990)
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:56 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:
