• Chivilikhin D., Ulyantsev V., Shalyto A.
    Proceedings of the 13th International Conference on Machine Learning and Applications (ICMLA'14), pp. 350-355,
  • Daniil Berezun and Neil D. Jones
    Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation,
  • Shpilman A.A., Nadezhdina E.S.
    Computational Stochastic Modeling of Cellular Microtubule Network
    46th Annual Meeting of the American Society for Cell Biology,
  • Koznov, D., Pliskin, M.
    Computer-supported collaborative learning with mind-maps
    Communications in Computer and Information Science 17 CCIS, pp. 478-489,
  • Ulyantsev V., Melnik M.
    Proceedings of International Conference on Algorithms for Computational Biology. - 2015. - 141-153,
  • Rustam Azimov, Semyon Grigorev

    The generalization of matrix-based Valiant's context-free language recognition algorithm for graph case is widely considered as a recipe for efficient context-free path querying; however, no progress has been made in this direction so far. We propose the first generalization of matrix-based Valiant's algorithm for context-free path querying. Our generalization does not deliver a truly sub-cubic worst-case complexity algorithm, whose existence still remains a hard open problem in the area. On the other hand, the utilization of matrix operations (such as matrix multiplication) in the process of context-free path query evaluation makes it possible to efficiently apply a wide class of optimizations and computing techniques, such as GPGPU, parallel processing, sparse matrix representation, distributed-memory computation, etc. Indeed, the evaluation on a set of conventional benchmarks shows, that our algorithm outperforms the existing ones.

    GRADES-NDA '18 Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA),
  • Semyon Grigorev, Anastasiya Ragozina

    Graph data model and graph databases are very popular in various areas such as bioinformatics, semantic web, and social networks. One specific problem in the area is a path querying with constraints formulated in terms of formal grammars. The query in this approach is written as grammar, and paths querying is graph parsing with respect to given grammar. There are several solutions to it, but how to provide structural representation of query result which is practical for answer processing and debugging is still an open problem. In this paper we propose a graph parsing technique which allows one to build such representation with respect to given grammar in polynomial time and space for arbitrary context-free grammar and graph. Proposed algorithm is based on generalized LL parsing algorithm, while previous solutions are based mostly on CYK or Earley algorithms, which reduces time complexity in some cases.

  • Dmitry Boulytchev, Eugene Vigdorchik
    Workshop on Multiparadigm Programming with Object-Oriented Languages,
  • V. Tankov and T. Bryksin
    Data-based code synthesis in IntelliJ IDEA
  • B. Novikov and H. Dombrovskaya
    BHV, St.-Petersburg,
  • George Chernishev, Viacheslav Galaktionov, Valentin Grigorev, Evgeniy Klyuchikov, Kirill Smirnov, Andrey Terekhov
    In Proceedings of DAMDID / RCDL'2016 (local), pages 132–137, Ershovo,
  • A. Shpilman, D. Boikiy, M. Plyakova, D. Kudenko, A. Burakov, E. Nadezhdina
    Sixteenth International Conference on Machine Learning and Applications (ICMLA),
  • Shpilman A., Shudinova E., Ivanov P., Nadezhdina E.
    Dependence of stress granule formation on microtubules supports the idea of stress granule specific “glue” arising in stress conditions
    54th Annual Meeting of the American Society for Cell Biology,
  • K. Krinkin, Elena Stotskaya, Yury Stotskiy
  • Timofey Bryksin, Victor Petukhov, Kirill Smirenko, Nikita Povarov
    Detecting anomalies in Kotlin code
    2nd International Workshop on Machine Learning techniques for Programming Languages,

Sort by:

Filter by group: