Polynomial Complete Problems in Automata Theory. - I. K. Rystsov (Inf. Process. Lett., 1983)

The Parallel Complexity of Some Arithemic and Algebraic Operations. - I. K. Rystsov (FCT, 1987)

Quasioptimal Bound for the Length of Reset Words for Regular Automata. - I. K. Rystsov (Acta Cybern., 1995)

Reset Words for Commutative and Solvable Automata. - Igor Rystsov (Theor. Comput. Sci., 1997)

Primitive Automata that are Synchronizing. - Igor Rystsov; Marek Szykula (CoRR, 2023)

Reset thresholds of transformation monoids. - Igor Rystsov; Marek Szykula (CoRR, 2023)

Cerny type automata and rank conjecture. - Igor Rystsov (CoRR, 2025)