Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValery S. Patsko
Person information
- affiliation: Russian Academy of Sciences, Ural Branch, Krasovskii Institute of Mathematics and Mechanics, Yekaterinburg, Russia
- affiliation: Ural Federal University, Yekaterinburg, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j10]Valery S. Patsko, Varvara L. Turova
:
Antony Merz and His Works. Dyn. Games Appl. 10(1): 157-182 (2020)
2010 – 2019
- 2019
- [j9]Valerii S. Patsko, Marc Quincampoix:
Preface: DGAA Special Issue on Pursuit-Evasion Games and Differential Games with Incomplete Information. Dyn. Games Appl. 9(3): 569-572 (2019) - [c4]Valerii S. Patsko, Andrey A. Fedotov:
Reachable set for Dubins car and its application to observation problem with incomplete information. MED 2019: 489-494 - 2017
- [j8]Sergey S. Kumkov, Stéphane Le Ménec, Valerii S. Patsko:
Zero-Sum Pursuit-Evasion Differential Games with Many Objects: Survey of Publications. Dyn. Games Appl. 7(4): 609-633 (2017) - [j7]Sergey S. Kumkov, Stéphane Le Ménec, Valerii S. Patsko:
Erratum to: Zero-Sum Pursuit-Evasion Differential Games with Many Objects: Survey of Publications. Dyn. Games Appl. 7(4): 634 (2017) - 2014
- [j6]Sergey S. Kumkov, Valery S. Patsko, Stéphane Le Ménec:
Two weak pursuers in a game against a single evader. Autom. Remote. Control. 75(10): 1770-1789 (2014) - [j5]Sergey S. Kumkov, Stéphane Le Ménec, Valery S. Patsko:
Level Sets of the Value Function in Differential Games with Two Pursuers and One Evader. Interval Analysis Interpretation. Math. Comput. Sci. 8(3-4): 443-454 (2014) - 2012
- [j4]Sergey Ganebny, Sergey S. Kumkov, Stéphane Le Ménec, Valerii S. Patsko:
Model Problem in a Line with Two Pursuers and One Evader. Dyn. Games Appl. 2(2): 228-257 (2012) - [c3]Valerii S. Patsko, Sergey Ganebny, Andrey A. Fedotov, Sergey S. Kumkov:
Model Problems of Aircraft Guidance in Education Program on Optimal Control and Differential Games. ACE 2012: 324-329
2000 – 2009
- 2009
- [c2]Sergey Ganebny, A. I. Krasov, Valerii S. Patsko, M. A. Smolnikova:
Problem of vertical passing an obstacle by an aircraft under wind disturbances. ECC 2009: 103-108 - 2005
- [j3]Sergey S. Kumkov, Valery S. Patsko, Josef Shinar:
On Level Sets with "Narrow Throats" in Linear differential Games. IGTR 7(3): 285-311 (2005) - 2004
- [j2]Valery S. Patsko, Varvara L. Turova:
Families of semipermeable curves in differential games with the homicidal chauffeur dynamics. Autom. 40(12): 2059-2068 (2004) - 2001
- [j1]Valery S. Patsko, Varvara L. Turova:
Level Sets of the Value Function in differential Games with the Homicidal Chauffeur Dynamics. IGTR 3(1): 67-112 (2001)
1990 – 1999
- 1999
- [c1]Valery S. Patsko, Varvara L. Turova:
Numerical Solution to the Acoustic Homicidal Chauffeur Game. System Modelling and Optimization 1999: 227-250
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 02:05 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:
