Rustam Azimov

Orcid: 0000-0003-0223-5172

According to our database1, Rustam Azimov authored at least 10 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Comparative Study of Machine Learning Methods and Text Features for Text Authorship Recognition in the Example of Azerbaijani Language Texts.
Algorithms, June, 2024

2022
Jumping Evaluation of Nested Regular Path Queries.
Proceedings of the Proceedings 38th International Conference on Logic Programming, 2022

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

Context-Free Path Querying In Terms of Linear Algebra.
Proceedings of the VLDB 2021 PhD Workshop co-located with the 47th International Conference on Very Large Databases (VLDB 2021), 2021

Context-free path querying with all-path semantics by matrix multiplication.
Proceedings of the GRADES-NDA '21: Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2021

2020
Context-Free Path Querying with Single-Path Semantics by Matrix Multiplication.
Proceedings of the GRADES-NDA'20: Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2020

Context-Free Path Querying by Kronecker Product.
Proceedings of the Advances in Databases and Information Systems, 2020

2019
Path Querying with Conjunctive Grammars by Matrix Multiplication.
Program. Comput. Softw., 2019

2018
Context-free path querying by matrix multiplication.
Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2018

2017
Graph Parsing by Matrix Multiplication.
CoRR, 2017


  Loading...