Relaxed Parsing of Regular Approximations of String-Embedded Languages. - Ekaterina Verbitskaia; Semyon V. Grigorev; Dmitry Avdyukhin (Ershov Memorial Conference, 2015)

Context-Free Path Querying with Structural Representation of Result. - Semyon V. Grigorev; Anastasiya Ragozina (CoRR, 2016)

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)

Parser combinators for context-free path querying. - Ekaterina Verbitskaia; Ilya Kirillov; Ilya Nozkin; Semyon V. Grigorev (SCALA@ICFP, 2018)

The Composition of Dense Neural Networks and Formal Grammars for Secondary Structure Analysis. - Semyon V. Grigorev; Polina Lunina (BIOINFORMATICS, 2019)

On Secondary Structure Analysis by Using Formal Grammars and Artificial Neural Networks. - Polina Lunina; Semyon V. Grigorev (CIBB, 2019)

Modification of Valiant's Parsing Algorithm for the String-Searching Problem. - Yuliya Susanina; Anna Yaveyn; Semyon V. Grigorev (CIBB, 2019)

Evaluation of the Context-Free Path Querying Algorithm Based on Matrix Multiplication. - Nikita Mishin; Iaroslav Sokolov; Egor Spirin; Vladimir Kutuev; Egor Nemchinov; Sergey Gorbatyuk; Semyon V. Grigorev (GRADES/NDA@SIGMOD/PODS, 2019)

Bar-Hillel Theorem Mechanization in Coq. - Sergey Bozhko; Leyla Khatbullina; Semyon V. Grigorev (WoLLIC, 2019)

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

Recursive Expressions for SPARQL Property Paths. - Ciro M. Medeiros; Umberto Souza da Costa; Semyon V. Grigorev; Martin A. Musicante (ADBIS/TPDL/EDA Workshops, 2020)

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

Optimizing GPU programs by partial evaluation. - Aleksey Tyurin; Daniil Berezun; Semyon V. Grigorev (PPoPP, 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)

Rational index of bounded-oscillation languages. - Ekaterina N. Shemetova; Alexander Okhotin; Semyon V. Grigorev (CoRR, 2020)

Multiple-Source Context-Free Path Querying in Terms of Linear Algebra. - Arseniy Terekhov; Vlada Pogozhelskaya; Vadim Abzalov; Timur Zinnatulin; Semyon V. Grigorev (EDBT, 2021)

SPbLA: The Library of GPGPU-Powered Sparse Boolean Linear Algebra Operations. - Egor Orachev; Maria Karpenko; Artem Khoroshev; Semyon V. Grigorev (IPDPS Workshops, 2021)

Context-free path querying with all-path semantics by matrix multiplication. - Rustam Azimov; Ilya Epelbaum; Semyon V. Grigorev (GRADES-NDA@SIGMOD, 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)

Path Querying on Acyclic Graphs Using Boolean Grammars. - Ekaterina N. Shemetova; Semyon V. Grigorev (Program. Comput. Softw., 2021)

Rational Index of Languages with Bounded Dimension of Parse Trees. - Ekaterina N. Shemetova; Alexander Okhotin; Semyon V. Grigorev (DLT, 2022)

SPbLA: The Library of GPGPU-powered Sparse Boolean Linear Algebra Operations. - Egor Orachev; Maria Karpenko; Pavel Alimov; Semyon V. Grigorev (J. Open Source Softw., 2022)

Fine-grained reductions around CFL-reachability. - Aleksandra Istomina; Semyon V. Grigorev; Ekaterina N. Shemetova (CoRR, 2023)

GLL-based Context-Free Path Querying for Neo4j. - Vadim Abzalov; Vlada Pogozhelskaya; Vladimir Kutuev; Semyon V. Grigorev (CoRR, 2023)

Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees. - Ekaterina N. Shemetova; Alexander Okhotin; Semyon V. Grigorev (Theory Comput. Syst., 2024)

PySymGym: An Infrastructure to Train AI-Powered Navigation Assistant for Symbolic Execution Engine. - Anna Chistyakova; Maxim Nigmatulin; Ekaterina Shemetova; Danil Parfenov; David Akhmedov; Semyon V. Grigorev (STATIC, 2025)

Universal High-Performance CFL-Reachability via Matrix Multiplication. - Ilia Muravev; Semyon V. Grigorev (SOAP@PLDI, 2025)