![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Oleksiy Kurganskyy
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
- [j3]Olivier Bournez
, Oleksiy Kurganskyy, Igor Potapov:
Reachability Problems for One-Dimensional Piecewise Affine Maps. Int. J. Found. Comput. Sci. 29(4): 529-549 (2018) - 2008
- [j2]Oleksiy Kurganskyy, Igor Potapov, Fernando Sancho-Caparrini
:
Reachability Problems in Low-Dimensional Iterative Maps. Int. J. Found. Comput. Sci. 19(4): 935-951 (2008) - 2003
- [j1]Matthias Jantzen, Alexy Kurganskyy:
Refining the hierarchy of blind multicounter languages and twist-closed trios. Inf. Comput. 185(2): 159-181 (2003)
Conference and Workshop Papers
- 2016
- [c7]Oleksiy Kurganskyy, Igor Potapov:
Reachability Problems for PAMs. SOFSEM 2016: 356-368 - 2007
- [c6]Oleksiy Kurganskyy, Igor Potapov, Fernando Sancho-Caparrini:
Computation in One-Dimensional Piecewise Maps. HSCC 2007: 706-709 - 2006
- [c5]Igor Grunsky
, Oleksiy Kurganskyy, Igor Potapov:
On a Maximal NFA Without Mergible States. CSR 2006: 202-210 - 2005
- [c4]Igor Grunsky, Oleksiy Kurganskyy, Igor Potapov:
Languages Representable by Vertex-Labeled Graphs. MFCS 2005: 435-446 - [c3]Oleksiy Kurganskyy, Igor Potapov:
Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems. UC 2005: 169-175 - 2004
- [c2]Oleksiy Kurganskyy, Igor Potapov:
On the Computation Power of Finite Automata in Two-dimensional Environments. Developments in Language Theory 2004: 261-271 - 2001
- [c1]Matthias Jantzen, Alexy Kurganskyy:
Refining the Hierarchy of Blind Multicounter Languages. STACS 2001: 376-387
Informal and Other Publications
- 2018
- [i6]Oleksiy Kurganskyy, Igor Potapov:
De Bruijn graphs and powers of 3/2. CoRR abs/1811.02254 (2018) - 2017
- [i5]Oleksiy Kurganskyy, Alexandra Maximova:
On co-counter-fragments of automata. CoRR abs/1712.05227 (2017) - 2015
- [i4]Oleksiy Kurganskyy, Igor Potapov:
Reachability problems for PAMs. CoRR abs/1510.04121 (2015) - 2010
- [i3]Oleksiy Kurganskyy, Igor Potapov:
A measure of state transition of collective of stateless automata in discrete environment. CoRR abs/1007.2353 (2010) - [i2]Oleksiy Kurgansky:
A state of a dynamic computational structure distributed in an environment: a model and its corollaries. CoRR abs/1007.3836 (2010) - [i1]Oleksiy Kurganskyy:
A collective of stateless automata in a $n$-dimensional environment as a distributed dynamic automaton-like object: a model and its corollaries. CoRR abs/1012.2203 (2010)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-05-08 21:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint