Подписаться
Rustam Azimov
Rustam Azimov
Неизвестная организация
Подтвержден адрес электронной почты в домене student.spbu.ru
Название
Процитировано
Процитировано
Год
Context-free path querying by matrix multiplication
R Azimov, S Grigorev
Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data …, 2018
362018
Context-free path querying with single-path semantics by matrix multiplication
A Terekhov, A Khoroshev, R Azimov, S Grigorev
Proceedings of the 3rd Joint International Workshop on Graph Data Management …, 2020
102020
Context-free path querying with all-path semantics by matrix multiplication
R Azimov, I Epelbaum, S Grigorev
Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data …, 2021
62021
Context-free path querying by kronecker product
E Orachev, I Epelbaum, R Azimov, S Grigorev
Advances in Databases and Information Systems: 24th European Conference …, 2020
62020
Path querying using conjunctive grammars
RS Azimov, SV Grigor'ev
Proceedings of the Institute for System Programming of the RAS 30 (2), 149-166, 2018
32018
One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and Context-Free Path Queries
E Shemetova, R Azimov, E Orachev, I Epelbaum, S Grigorev
arXiv preprint arXiv:2103.14688, 2021
22021
Path Querying with Conjunctive Grammars by Matrix Multiplication
R Azimov, S Grigorev
Programming and Computer Software 45, 357-364, 2019
22019
Context-Free Path Querying In Terms of Linear Algebra.
R Azimov
PhD@ VLDB, 2021
12021
Graph Parsing by Matrix Multiplication
R Azimov, S Grigorev
CoRR, 2017
12017
SCIENTIFIC AND TECHNICAL JOURNAL OF INFORMATION TECHNOLOGIES, MECHANICS AND OPTICS
IV EPELBAUM, R AZIMOV, SV GRIGOREV
SCIENTIFIC AND TECHNICAL JOURNAL OF INFORMATION TECHNOLOGIES, MECHANICS AND …, 2023
2023
Jumping Evaluation of Nested Regular Path Queries
J Niehren, S Salvati, R Azimov
arXiv preprint arXiv:2208.03088, 2022
2022
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–11