Fast Computation of the N-th Term of a q-Holonomic Sequence and Applications. - Alin Bostan; Sergey Yurkevich (CoRR, 2020)

Extended abstract for: solving rupert's problem algorithmically. - Jakob Steininger; Sergey Yurkevich (ACM Commun. Comput. Algebra, 2022)

The art of algorithmic guessing in gfun. - Sergey Yurkevich (Maple Trans., 2022)

Beating binary powering for polynomial matrices. - Alin Bostan; Vincent Neiger; Sergey Yurkevich (ISSAC, 2023)

On the $q$-Analogue of Pólya's Theorem. - Alin Bostan; Sergey Yurkevich (Electron. J. Comb., 2023)

Fast computation of the N-th term of a q-holonomic sequence and applications. - Alin Bostan; Sergey Yurkevich (J. Symb. Comput., 2023)

Integer sequences, differential operators and algebraic power series. (Suites entières, séries algébriques et opérateurs différentiels). - Sergey Yurkevich (2023)

An algorithmic approach to Rupert's problem. - Jakob Steininger; Sergey Yurkevich (Math. Comput., 2023)

Systems of Discrete Differential Equations, Constructive Algebraicity of the Solutions. - Hadrien Notarantonio; Sergey Yurkevich (Comb. Theory, 2025)