Ilya Epelbaum

Orcid: 0000-0003-2660-6193

According to our database1, Ilya Epelbaum authored at least 3 papers between 2020 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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 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 by Kronecker Product.
Proceedings of the Advances in Databases and Information Systems, 2020


  Loading...