Semyon V. Grigorev

Orcid: 0000-0002-7966-0698

Affiliations:
  • St. Petersburg State University, Russia


According to our database1, Semyon V. Grigorev authored at least 25 papers between 2015 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
GLL-based Context-Free Path Querying for Neo4j.
CoRR, 2023

Fine-grained reductions around CFL-reachability.
CoRR, 2023

2022
SPbLA: The Library of GPGPU-powered Sparse Boolean Linear Algebra Operations.
J. Open Source Softw., 2022

Rational Index of Languages with Bounded Dimension of Parse Trees.
Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021
Path Querying on Acyclic Graphs Using Boolean Grammars.
Program. Comput. Softw., 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

SPbLA: The Library of GPGPU-Powered Sparse Boolean Linear Algebra Operations.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2021

Multiple-Source Context-Free Path Querying in Terms of Linear Algebra.
Proceedings of the 24th International Conference on Extending Database Technology, 2021

2020
Rational index of bounded-oscillation languages.
CoRR, 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

Optimizing GPU programs by partial evaluation.
Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

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

Recursive Expressions for SPARQL Property Paths.
Proceedings of the ADBIS, TPDL and EDA 2020 Common Workshops and Doctoral Consortium, 2020

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

Bar-Hillel Theorem Mechanization in Coq.
Proceedings of the Logic, Language, Information, and Computation, 2019

Evaluation of the Context-Free Path Querying Algorithm Based on Matrix Multiplication.
Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2019

Modification of Valiant's Parsing Algorithm for the String-Searching Problem.
Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2019

On Secondary Structure Analysis by Using Formal Grammars and Artificial Neural Networks.
Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2019

The Composition of Dense Neural Networks and Formal Grammars for Secondary Structure Analysis.
Proceedings of the 12th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2019), 2019

2018
Parser combinators for context-free path querying.
Proceedings of the 9th ACM SIGPLAN International Symposium on Scala, 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

2016
Context-Free Path Querying with Structural Representation of Result.
CoRR, 2016

2015
Relaxed Parsing of Regular Approximations of String-Embedded Languages.
Proceedings of the Perspectives of System Informatics, 2015


  Loading...