Research Papers

     Slisenko, A. O.
         Some properties of arithmetic operations over duplexes. (Russian)
         Dokl. Akad. Nauk SSSR 152, 1963, 292--295.
         MR 28#31

     Slisenko, A. O.
         On certain algorithmic problems connected with arithmetic operations on duplexes. (Russian)
         Trudy Mat. Inst. Steklov. 72, 1964, 488--523.
         MR 34 #2460

     Slisenko, A. O.
        On constructive non-separable spaces.  (Russian)
        Trudy Mat. Inst. Steklov. 72 1964 533--536.
        MR 33 #3929

     Slisenko, A. O.
        Example of a non-discontinous but  not continuous constructive operator in a metric space. (Russian)
        Trudy Mat. Inst. Steklov. 72, 1964, 524--532.
        MR 33 #3928

     Shanin, N. A.; Davydov, G. V.; Maslov, S. Ju.; Minc, G. E.;  Orevkov, V. P.; Slisenko, A. O.
       Algorifm mashinnogo poiska estestvennogo  logicheskogo vyvoda v ischislenii vyskazyvanii. (Russian)
          [An algorithm for a machine scan of a  natural logical deduction in a propositional calculus]
       Academy of Sciences of the USSR. V.A. Steklov Mathematical Institute. Leningrad Department
       ``Nauka'', Moscow 1965, 39 pp.
       MR 33 #5405

     Slisenko, A. O.
        The maximal continuity regulators of  constructive functions. (Russian)
        Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 4, 1967, 201--208.
        MR 39 #4000

     Slisenko, A. O.
        The construction of maximal  continuity regulators of constructive functions. (Russian)
        Trudy Mat. Inst. Steklov. 93, 1967, 208--249.
        MR 39 #1871

     Slisenko, A. O.
        Arithmetical operations on  certain sets of duplexes. (Russian)
        Trudy Mat. Inst. Steklov. 93, 1967,  187--207.
        MR 37 #3920

     Davydov, G. V.; Maslov, S. Ju.; Minc, G. E.; Orevkov, V. P.; Slisenko, A. O.
        A machine algorithm for estabilshing deducibility on the basis of the inverse method. (Russian)
        Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 16, 1969, 8--19.
        MR 41 #3278

     Slisenko, A. O.
        Certain questions of the  approximation of the maximal regulators of continuity. (Russian)
        Trudy  Mat. Inst. Steklov. 113, 1970, 73--78.
        MR 46 #1969

     Slisenko, A. O.
       A certain property  of enumerable sets that contain "hard to deduce" formulae. (Russian)
       Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 20, 1971, 200--207, 288.
       MR 44 #6501

     Slisenko, A. O.
       Identification of  the symmetry predicate by means of multihead Turing machines with input. (Russian)
       Problems in the constructive trend in mathematics, 6.
       Trudy Mat. Inst. Steklov. 129, 1973, 30--202, 267.
       MR 55 #5410

     Slisenko, A. O.
       A finite approach  to the problem of the optimization of algorithms for theorem-proving. (Russian)
       Theoretical applications of the methods of mathematical logic, I.
       Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 49, 1975, 123--130, 178.
       MR 51 #12489

     Slisenko, A. O.
       A simplified proof  of the real-time recognizability of palindromes on Turing machines. (Russian)
       Theoretical applications of the methods of mathematical logic, II.
       Zap. Nau\v cn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 68, 1977, 123--139, 146--147.
       MR 58 #19361

     Slisenko, A. O.
       Computational complexity of string and graph identification.
       Mathematical foundations of computer science, 1979 (Proc. Eighth Sympos., Olomouc, 1979), pp. 182--190,
       Lecture Notes in Comput. Sci., 74, Springer, Berlin-New York, 1979.
       MR 81d:68048

     Slisenko, A. O.
       Real-time detection of  all the periodicities in a word. (Russian)
       Dokl. Akad. Nauk SSSR 251, 1980, no. 1, 48--51.
       MR 82h:68053

     Slisenko, A. O.
       Complexity problems of the  theory of computations. (Russian)
       Uspekhi Mat. Nauk 36, 1981,  no. 6(222), 21--103, 264.
       MR 84f:68037

     Adel'son-Vel'skii , G. M.; Slisenko, A. O.
        What  can we do with problems of exhaustive search?
        Algorithms in modern mathematics and computer science (Urgench, 1979), pp. 315--342,
        Lecture Notes in Comput. Sci., 122, Springer, Berlin-New York, 1981.
        MR 83g:68055

     Slisenko, A. O.
        Context-free grammars as a tool  for describing polynomial-time subclasses of hard problems.
        Inform. Process. Lett. 14, 1982, no. 2, 52--62.
        MR 83h:68064

     Slisenko, A. O.
        Linguistic considerations in devising effective algorithms.
        Proceedings of the International Congress of Mathematicians, Vol. 1, 2 (Warsaw, 1983), 347--357,
        PWN, Warsaw, 1984.
        MR 87h:68073

     Krik, T.; Slisenko, A. O.; Solernó, P.; Khaints, I.
        A search  for the shortest path around semi-algebraic obstacles in the plane. (Russian)
        Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 192, 1991,
        Teor. Slozhn. Vychisl. 5, 163--173, 176.
        MR 93b:68088

     Slissenko, A. O.
        On fault tolerance of syntax.
        5th Soviet-French Symposium on Theoretical Computer Science,
           Methods and Tools for Compilation, and Program Development (Informatika '91) (Grenoble, 1991).
       Theoret. Comput. Sci. 119 (1993), no. 1, 215--222.
       MR 94h:68120

     Beauquier, Daniøle; Burago, Dima; Slissenko, Anatol.
       On the complexity of finite memory policies for Markov decision processes.
       Mathematical foundations of computer science 1995 (Prague), 191--200,
       Lecture Notes in Comput. Sci., 969, Springer, Berlin, 1995.

     Burago, Dima; de Rougemont, Michel; Slissenko, Anatol.
       On  the complexity of partially observed Markov decision processes.
       Theoret. Comput. Sci. 157 (1996), no. 2, 161--183.
       MR 97a:68075

     Grigoriev, D.; Slissenko, A.
       Computing minimum-link  path in a homotopy class amidst semi-algebraic obstacles in the plane.
       Applied algebra, algebraic algorithms and error-correcting codes (Toulouse, 1997), 114--129,
       Lecture  Notes in Comput. Sci., 1255, Springer, Berlin, 1997.

     Beauquier, Daniøle; Slissenko, Anatol.
       Polytime model  checking for timed probabilistic computation tree logic.
       Acta Inform. 35 (1998), no. 8, 645--664.
       MR 99f:68133

     Slissenko, Anatol.
       Leningrad/St.Petersburg (1961--1998): from  logic to complexity and further.
       People & ideas in theoretical computer science, 274--313,
       Springer Ser. Discrete Math. Theor. Comput. Sci., Springer, Singapore, 1999.

Biographical papers

     Maslov, S. Ju.; Matijasevich, Ju. V.; Minc, G. E.; Orevkov, V. P.; Slisenko, A. O.
       Nikolai Aleksandrovich Shanin (on the occasion of his 60th birthday). (Russian)
       Uspekhi Mat. Nauk 35 (1980), no. 2(212), 241--245.
       MR 82g:01063

     Davydov, G. V.; Matiyasevich, Yu. V.; Mints, G. E.; Orevkov,  V. P.; Slisenko, A. O.; Sochilina, A. V.; Shanin,  N. A.
       Sergei Yur'evich Maslov (obituary). (Russian)
       Uspekhi Mat. Nauk 39 (1984), no. 2(236), 129--30.
       MR 85m:01059

     Matiyasevich, Yu. V.; Mints, G. E.; Orevkov, V. P.; Slisenko, A. O.
        Nikolai Aleksandrovich Shanin (on the occasion of his seventieth birthday). (Russian)
        Uspekhi Mat. Nauk 45 (1990), no. 1(271),205--206;
        translation in Russian Math. Surveys 45 (1990), no. 1, 239--240
        MR 91h:01069
 

Editing

     Studies in  constructive mathematics and mathematical logic. Part I.
        Edited by A. O. Slisenko.
        Seminars in Mathematics, V. A. Steklov Mathematical Institute, Leningrad, Vol. 4
        Consultants Bureau, New York 1969,  viii+88 pp.
        MR 39 #2595

     Studies in constructive mathematics and  mathematical logic, Part II.
        Edited by A. O. Slisenko.
        Seminars in Mathematics, V. A. Steklov Mathematical Institute, Leningrad, Vol. 8.
        Consultants Bureau, New York-London, 1970. viii+136 pp.
        MR 46 #8817

     Studies in constructive mathematics  and mathematical logic, Part III.
        Edited by A. O. Slisenko.
        Seminars in Mathematics, V. A. Steklov Mathematical Institute, Leningrad, Vol. 16.
        Consultants Bureau, New York-London, 1971. viii+97 pp.
        MR 46 #8818

     Issledovaniya po konstruktivnoi  matematike i matematicheskoi logike.V. (Russian)
          [Investigations in constructive mathematics and mathematical logic. V]
       A collection of articles edited by Ju. V. Matijasevic and A.O.Slisenko.
       Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 32, (1972).
       ``Nauka'',  Leningrad, 1972. 162 pp.
       MR 48 #50 MR 56 #8313

     Issledovaniya po konstruktivni matematike  i matematicheskoi logike. VI. (Russian)
          [Investigations in constructive mathematics and mathematical logic. VI]
        A collection of articles edited by Ju. V. Matijasevich and A. O. Slisenko.
        Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 40, (1974).
        ``Nauka'', Leningrad, 1974. 163 pp.
       MR 49 #10522

     Issledovaniya po konstruktivnoi matematike  i matematichesko logike. VII. (Russian)
           [Studies in constructive mathematics and mathematical logic. VII]
       Edited by Ju. V. Matijasevich and A. O. Slisenko.
       Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 60, (1976).
      "Nauka",  Leningrad, 1976. 229 pp.
      MR 54 #9966

     Issledovaniya po konstruktivnoi matematike i  matematicheskoi logike. VIII. (Russian)
          [Studies in constructive mathematics and mathematical logic. VIII]
       Edited by Ju. V. Matijasevich and A. O. Slisenko.
       Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 88, (1979).
      "Nauka"., Leningrad, 1979. pp. 1--252.
      MR 80j:03005

     Teoriya slozhnosti vychislenii . I. (Russian)
          [The  theory of the complexity of computations. I]
       Edited by D. Yu. Grigor'ev and A. O. Slisenko.
       Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 118, (1982).
       "Nauka"., Leningrad, 1982. pp. 1--216.
       MR 83f:68002

     Teoriya slozhnosti vychislenii. II. (Russian)
         [The theory  of the complexity of computations. II]
       Edited by A. O. Slisenko and D. Yu. Grigor'ev.
       Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 137, (1984).
       "Nauka"., Leningrad, 1984. pp. 1--192 pp.
       MR 85h:00007

     Døvenport, Dzh.
       Integrirovanie  algebraicheskikh funktsii. (Russian)
          [Integration of algebraic functions]
       Translated from the English by G. E. Mints.
       Translation edited and with a preface by A. O. Slisenko.
      ``Mir'',  Moscow, 1985. 192 pp.
       MR 86m:12009

     Matematicheskie metody postroeniya i analiza algoritmov.  (Russian)
          [Mathematical methods for constructing and analyzing algorithms]
       Edited by A. O. Slisenko and S. V. Solov'ev.
      "Nauka", Leningrad, 1990. 238 pp.
      ISBN: 5-02-024464-3           MR 91h:00024

     Algorithmic complexity of algebraic and  geometric models.
       Proceedings of the workshop held at the University of Paris-12, Creteil, June 6--7, 1994.
       Edited by A. Slissenko.
       Theoret. Comput. Sci. {157} (1996), no. 1.
       Elsevier  Science Publishers, B.V., Amsterdam, 1996. pp. i--ii and 1--136.
       MR 96j:68003
 

 Translations

     Gudstein, R. L.
         Rekursivnyi matematicheskii analiz. (Russian)
            [Recursive mathematical analysis]
         Translated from the English by A. O. Slisenko.
         Edited by G. E. Minc.
         Series on Mathematical Logic and the Foundations of Mathematics.
         ``Nauka'', Moscow, 1970. 472 pp.
         MR 50 #4261

     Aho, A.; Hopkroft, Dzh.; Ul'man, Dzh.
         Postroenie  i analiz vychislitel'nykh algoritmov. (Russian)
            [The design and analysis of computer algorithms]
         Translated by A. O. Slisenko.
         Edited by Ju. V. Matijasevich.
         "Mir", Moscow; distributed by Imported Publications, Chicago, Ill., 1979. 536 pp.
         MR 80g:68036