1 - 4 out of 4Page size: 10
  1. 2021

  2. One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and Context-Free Path Queries

    Shemetova, E., Azimov, R., Orachev, E., Epelbaum, I. & Grigorev, S., 26 Mar 2021.

    Research output: Working paper › Preprint

  3. 2020

  4. Context-Free Path Querying by Kronecker Product

    Orachev, E., Epelbaum, I., Azimov, R. & Grigorev, S., Aug 2020, Advances in Databases and Information Systems - 24th European Conference, ADBIS 2020, Proceedings. Darmont, J., Novikov, B. & Wrembel, R. (eds.). Springer Nature, p. 49-59 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12245 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  5. 2019

  6. Path Querying with Conjunctive Grammars by Matrix Multiplication

    Azimov, R. & Grigorev, S., 1 Dec 2019, In: Programming and Computer Software. 45, 7, p. 357-364 8 p.

    Research output: Contribution to journal › Article › peer-review

  7. 2018

  8. Context-free path querying by matrix multiplication

    Azimov, R. & Grigorev, S., 10 Jun 2018, Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences and Systems (GRADES) and Network Data Analytics (NDA), GRADES-NDA 2018. Bhattacharya, A., Fletcher, G., Roy, S., Arora, A., Larriba Pey, J. L. & West, R. (eds.). Association for Computing Machinery, a5. (Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences and Systems (GRADES) and Network Data Analytics (NDA), GRADES-NDA 2018).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

ID: 13807330