Research interests

automata theory, formal languages theory, graph theory, algorithm complexity, quantum computing, logic, cryptography.

Diplomas

1993 - Specialist diploma in "Mathematics", Donetsk State University;
1997 - PhD diploma in "theoretical cybernetics", Saratov State University, Russia;

Career

1993-1996 - PhD student in Institute of Applied Mathematics & Mechanics;
1997-1998 - engineer in Theory Control System Department, Institute of Applied Mathematics & Mechanics;
1998-1999 - researcher in University of Hamburg;
1999-2003 - mathematician in industry
2003-2007 - scientific researcher in Theory Control System Department
2007-present time - senior scientific researcher in Theory Control System Department

Publications

1. [1993] Грунский И.С., Курганский А.Н. Неотличимость конечных автоматов, взаимодействующих со средой // Докл. АН Украины. – 1993. – вып.11. – С.31-33.
    
2. [1996] Грунский И.С., Курганский А.Н. Неотличимость конечных автоматов с ограниченным поведением // Кибернетика и системный анализ. – 1996. – N5. – С.58-72.
    
3. [1997] Kurganskyy A.N. Indistinguishability of the finite automata interacting with an environment, Thesis, Saratov State University, Russia, 1997 (in Russian).
    
    
   Download in PDF format
4. [1999] A. N. Kurganskii and I. G. Potapov
    
   On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels . Cybernetics and System Analysis, Kiev, Ukraine, Volume 35, Number 3, May, 1999, p. 49-57
5. [2001] M.Jantzen, A.Kurganskyy Refining the hierarchy of blind multicounter languages // STACS’01, LNCS, vol. 2010, Springer, 2001, pp. 376–387.
    
6. [2001] Matthias Jantzen and Alexy Kurganskyy. Refining the hierarchy of blind multicounter languages. Bericht des Fachbereichs Informatik FBI-HH-B- 229/01, Universität Hamburg, Fachbereich Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, 2001.
    
    
   Download in PDF format
7. [2001] Курганський А.Н. Невідмінність скінченних автоматів відносно деяких середовищ // Кибернетика и системный анализ. – 2001. – № 1. – с.43-55
    
8. [2003] M.Jantzen, A.Kurganskyy Refining the hierarchy of blind multicounter languages and twist-closed trios // Information and Computation, Volume 185, Issue 2, 2003, Pages 159-181.
    
9. [2004] И.С.Грунский, Курганский А.Н. Языки графов с помеченными вершинами // Труды ИПММ НАНУ, 2004, вып. 9, c. 53-60
    
10. [2004] O.Kurganskyy, I.Potapov, On the computation power of finite automata in two dimensional environments // DLT'04, LNCS, vol. 3340, 2004, pp. 261-273.
     
11. [2005] I.Grunsky, O.Kurganskyy, I.Potapov Languages Representable by Vertex-labeled Graphs // Mathematical Foundations of Computer Science, MFCS'05, LNCS, v.3618, 2005, 435-446.
     
12. [2005] O.Kurganskyy, I.Potapov Universality of one-dimensional piecewise elementary maps // Труды ИПММ НАНУ, 2005, вып. 10, c. 131-134.
     
13. [2005] O.Kurganskyy, I.Potapov, Universality of walking automata on a class of geometric environments // Computability in Europe: New Computational Paradigms, Amsterdam, ILLC Publications X-2005-01, 2005, pp. 122-131.
     
14. [2005] O.Kurganskyy, I.Potapov. Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems // Unconventional Computation, UC'05, LNCS, v.3699, 2005, 169-175.
     
15. [2006] I.Grunsky, O.Kurganskyy, I.Potapov On a Maximal NFA Without Mergible States // Proceedings of the First International Computer Science Symposium, CSR 2006, LNCS, v.3967, 2006, 202-210.
     
16. [2007] O.Kurganskyy, I.Potapov, Fernando Sancho Caparrini, Computation in One-Dimensional Piecewise Maps // Hybrid Systems: Computation and Control, HSCC'07, LNCS, v. 4416, 2007, 706-709
     
17. [2007] O.Kurganskyy, I.Potapov, Fernando Sancho Caparrini, Reachability problems in low-dimensional iterative maps // International Workshop on Reachability Problems in Computational Models, Turku, Finland, TUCS General Publications Series, v.45, 2007, 38-52.
     
18. [2007] Грунский И.С., Курганский А.Н. Динамика коллектива автоматов в дискретной среде // Труды ИПММ НАНУ, 2007, вып. 15, c. 50-56.
     
19. [2008] O.Kurganskyy, I.Potapov Walking Automata on a Class of Geometric Environments // Труды ИПММ НАНУ, 2008, вып. 18, c. 96-109.
     
     
    Download in PDF format
20. [2008] O.Kurganskyy, I.Potapov, Fernando Sancho Caparrini Reachability problems in low-dimensional iterative maps // International Journal of Foundations of Computer Science, Vol. 19, No. 4 (2008) pp. 935-951.
     
21. [2008] Курганский А.Н. Мера изменения внутреннего состояния коллектива автоматов в дискретной среде // Труды ИПММ НАНУ, 2008, вып. 16, c. 117-123.
     
22. [2009] Курганский А.Н. Собственное состояние коллектива автоматов в дискретной среде // Труды VIII Международной конференции "Дискретные модели в теории управляющих систем" (Москва, 6-9 апреля 2009 г.). М., Макс-Пресс, 2009, с. 191-197.
     
     
    Download in PDF format
23. [2010] Oleksiy Kurgansky
     
    A state of a dynamic computational structure distributed in an environment: a model and its corollaries // eprint arXiv:1007.3836, 1-11, 2010
24. [2010] Oleksiy Kurganskyy
     
    A collective of stateless automata in a $n$-dimensional environment as a distributed dynamic automaton-like object: a model and its corollaries // eprint arXiv:1012.2203, 1-9, 2010
25. [2010] Oleksiy Kurganskyy, Igor Potapov
     
    A measure of state transition of collective of stateless automata in discrete environment // eprint arXiv:1007.2353, 1-13, 2010