A. O. Slisenko

	1982
4		A. O. Slisenko: Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems. Inf. Process. Lett. 14(2): 52-56 (1982)
	1979
3		G. M. Adelson-Velskiy, A. O. Slisenko: What can we do with problems of exhaustive search?. Algorithms in Modern Mathematics and Computer Science 1979: 315-342
2		A. O. Slisenko: Computational Complexity of String and Graph Identification. MFCS 1979: 182-190
	1978
1		A. O. Slisenko: String-Matching in Real Time: Some Properties of the Data Structure. MFCS 1978: 493-496

Coauthor Index

1

G. M. Adelson-Velskiy

[3]