Research
My research lies at the intersection of discrete mathematics, automata theory and theoretical computer science. I am interested in rigorous mathematical models as well as their connections to algorithmic and applied problems.
Main directions
Linear automata and completeness
I study algebraic properties of linear automata, including completeness questions for finite systems of automata over subrings of rational numbers. This direction formed the basis of my 2022 candidate dissertation, Linear Automata over Subrings of Rational Numbers.
Discrete mathematics and graph algorithms
My interests include combinatorial methods, graph algorithms and their use in VLSI design. I contribute to courses that connect graph-theoretic models with circuit layout and synthesis problems.
Efficient search and machine learning
I also work with practical methods for similarity search in high-dimensional spaces, neural networks and error-correcting codes. Recent seminar talks cover approximate nearest-neighbour search and neural-network-assisted error correction.