String-Matching in Real Time: Some Properties of the Data Structure. - A. O. Slisenko (MFCS, 1978)

What can we do with problems of exhaustive search?. - G. M. Adelson-Velskiy; A. O. Slisenko (Algorithms in Modern Mathematics and Computer Science, 1979)

Computational Complexity of String and Graph Identification. - A. O. Slisenko (MFCS, 1979)

Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems. - A. O. Slisenko (Inf. Process. Lett., 1982)