Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Oleksiy Kurganskyy
Oleksiy Kurgansky – Alexy Kurganskyy
2010 – today
- 2012
[i4]- 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)
2000 – 2009
- 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)- 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- 2003
[j1]Matthias Jantzen, Alexy Kurganskyy: Refining the hierarchy of blind multicounter languages and twist-closed trios. Inf. Comput. 185(2): 159-181 (2003)- 2001
[c1]Matthias Jantzen, Alexy Kurganskyy: Refining the Hierarchy of Blind Multicounter Languages. STACS 2001: 376-387
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-10-11 22:32 CEST by the dblp team



