Graph Parsing by Matrix Multiplication. - Rustam Azimov; Semyon V. Grigorev (CoRR, 2017)

Context-free path querying by matrix multiplication. - Rustam Azimov; Semyon V. Grigorev (GRADES/NDA@SIGMOD/PODS, 2018)

Path Querying with Conjunctive Grammars by Matrix Multiplication. - Rustam Azimov; Semyon V. Grigorev (Program. Comput. Softw., 2019)

Context-Free Path Querying by Kronecker Product. - Egor Orachev; Ilya Epelbaum; Rustam Azimov; Semyon V. Grigorev (ADBIS, 2020)

Context-Free Path Querying with Single-Path Semantics by Matrix Multiplication. - Arseniy Terekhov; Artyom Khoroshev; Rustam Azimov; Semyon V. Grigorev (GRADES-NDA@SIGMOD, 2020)

Context-free path querying with all-path semantics by matrix multiplication. - Rustam Azimov; Ilya Epelbaum; Semyon V. Grigorev (GRADES-NDA@SIGMOD, 2021)

Context-Free Path Querying In Terms of Linear Algebra. - Rustam Azimov (PhD@VLDB, 2021)

One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and Context-Free Path Queries. - Ekaterina N. Shemetova; Rustam Azimov; Egor Orachev; Ilya Epelbaum; Semyon V. Grigorev (CoRR, 2021)

Jumping Evaluation of Nested Regular Path Queries. - Joachim Niehren; Sylvain Salvati; Rustam Azimov (ICLP Technical Communications / Doctoral Consortium, 2022)

A Comparative Study of Machine Learning Methods and Text Features for Text Authorship Recognition in the Example of Azerbaijani Language Texts. - Rustam Azimov; Efthimios Providas (Algorithms, 2024)