Biography
I study Theoretical Computer Science (TCS). This means that I prove statements about that certain computations can be done fast, but others can not. In particular, this subject includes classical polynomial time algorithms (relevant in ICPC-style competitions), the P vs NP question (one of the seven Millennium Prize Problems) as well as modern viewpoints that allow to estimate the complexity of certain problems, computations, protocols, etc. more thoroughly.
Apart from the research work, I teach algorithms and other TCS-based subjects in Saint Petersburg and I am able to supervise motivated students (Bachelor’s, Master’s or PhD) in a wide scope of related research projects. These projects usually are of interest to students with an experience in math or programming competitions.
One can find more info about me, my research and work experience on my personal website.