Approximating the Maximum Number of Synchronizing States in Automata. - Andrew Ryzhikov (CoRR, 2016)

On Minimum Maximal Distance-k Matchings. - Yury Kartynnik; Andrew Ryzhikov (Electron. Notes Discret. Math., 2016)

Finding Short Synchronizing Words for Prefix Codes. - Andrew Ryzhikov; Marek Szykula (MFCS, 2018)

Subset Synchronization in Monotonic Automata. - Andrew Ryzhikov; Anton Shemyakov (Fundam. Informaticae, 2018)

A note on scheduling container storage operations of two non-passing stacking cranes. - Mikhail Y. Kovalyov; Erwin Pesch; Andrew Ryzhikov (Networks, 2018)

Mortality and Synchronization of Unambiguous Finite Automata. - Andrew Ryzhikov (WORDS, 2019)

Words of Minimum Rank in Deterministic Finite Automata. - Jarkko Kari; Andrew Ryzhikov; Anton Varonka (DLT, 2019)

Palindromic Subsequences in Finite Words. - Clemens Müllner; Andrew Ryzhikov (LATA, 2019)

On automata recognizing birecurrent sets. - Andrew Ryzhikov (Theor. Comput. Sci., 2019)

Synchronization problems in automata without non-trivial cycles. - Andrew Ryzhikov (Theor. Comput. Sci., 2019)

The Degree of a Finite Set of Words. - Dominique Perrin; Andrew Ryzhikov (FSTTCS, 2020)

Synchronizing automata and coding theory. (Automates synchronisant et théorie du codage). - Andrew Ryzhikov (2020)

Synchronizing Strongly Connected Partial DFAs. - Mikhail V. Berlinkov; Robert Ferens; Andrew Ryzhikov; Marek Szykula (STACS, 2021)

Finitely generated submonoids. - Dominique Perrin; Andrew Ryzhikov (CoRR, 2021)

Fixed interval scheduling with third-party machines. - Ilia Fridman; Mikhail Y. Kovalyov; Erwin Pesch; Andrew Ryzhikov (Networks, 2021)

Formal and Empirical Studies of Counting Behaviour in ReLU RNNs. - Nadine El-Naggar; Andrew Ryzhikov; Laure Daviaud; Pranava Madhyastha; Tillman Weyde (ICGI, 2023)

Universality and Forall-Exactness of Cost Register Automata with Few Registers. - Laure Daviaud; Andrew Ryzhikov (MFCS, 2023)

Traversing automata with current state uncertainty under LTLf constraints. - Andrew Ryzhikov; Petra Wolf 002 (CoRR, 2023)

Reachability in Fixed VASS: Expressiveness and Lower Bounds. - Andrei Draghici; Christoph Haase; Andrew Ryzhikov (FoSSaCS (2), 2024)

Monoids of Upper Triangular Matrices over the Boolean Semiring. - Andrew Ryzhikov; Petra Wolf 002 (MFCS, 2024)

On Shortest Products for Nonnegative Matrix Mortality. - Andrew Ryzhikov (RP, 2024)

Boundedness of Cost Register Automata over the Integer Min-Plus Semiring. - Andrei Draghici; Radoslaw Piórkowski; Andrew Ryzhikov (CSL, 2025)

The Complexity of Reachability Problems in Strongly Connected Finite Automata. - Stefan Kiefer; Andrew Ryzhikov (MFCS, 2025)

Efficiently Computing the Minimum Rank of a Matrix in a Monoid of Zero-One Matrices. - Stefan Kiefer; Andrew Ryzhikov (STACS, 2025)

Careful synchronisation and the diameter of transformation semigroups with few generators. - Andrew Ryzhikov (CoRR, 2025)

The complexity of computing the period and the exponent of a digraph. - Stefan Kiefer; Andrew Ryzhikov (Inf. Process. Lett., 2026)