Yaroslav Sokolov


Student at St. Petersburg State University, Mathematics and Mechanics Faculty, Software Engineering Department.

Areas of interest: deep learning, GPGPU programming.


  • The goal of this project is to improve the code synthesis methods. We are currently actively exploring how to apply the latest neural network architectures from the NLP domain and how to efficiently use the tree-like code structure.
    Project supervisor: Timofey Bryksin
  • The goal of the project is to develop a tool for fragment code completion as a plugin for IntelliJ platform.
    Project supervisor: Timofey Bryksin


  • Nikita Mishin, Iaroslav Sokolov, Egor Spirin, Vladimir Kutuev, Egor Nemchinov, Sergey Gorbatyuk, and Semyon Grigorev
    Recently proposed matrix multiplication based algorithm for context-free path querying (CFPQ) offloads the most performance-critical parts onto boolean matrices multiplication. Thus, it is possible to achieve high performance of CFPQ by means of modern parallel hardware and software. In this paper, we provide results of empirical performance comparison of different implementations of this algorithm on both real-world data and synthetic data for the worst cases.
    Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), June 2019