A. Slisenko

Studies in constructive mathematics and mathematical logic

A. Slisenko, 1969 .

Studies in Constructive Mathematics and Mathematical Logic Part 2

A. Slisenko, 1970 .

Complexity problems in computational theory

A. Slisenko, 1981 .

Search for shortest path around semialgebraic obstacles in the plane

J. Heintz, A. Slisenko, T. Krick, 1994 .

Nikolai Aleksandrovich Shanin (obituary)

G. V. Davydov, M. A. Vsemirnov, E. F. Karavaev, 2013 .

Nikolai Aleksandrovich Shanin (on his seventieth birthday)

G. Mints, A. Slisenko, V. Orevkov, 1990 .

On the Complexity of Certain Decision Procedures for Proposi- Tional Calculus and Random Graphs. Announced As: an Improved Lower Bound for Regular Resolution and Similar Systems

A. Slisenko, 2007 .

What can we do with problems of exhaustive search?

G. M. Adelson-Velskiy, A. O. Slisenko, A. Slisenko, 1979, Algorithms in Modern Mathematics and Computer Science.

Detection of periodicities and string-matching in real time

A. O. Slisenko, A. Slisenko, 1983 .