Anatol Olesjewitsch Slissenko
Anatol Olesjewitsch Slissenko ( Russian Анатоль Олесьевич Слисенко , English transcription Anatol Olesevich Slissenko , also Slisenko ; * August 15, 1941 ) is a Russian mathematician and computer scientist who deals with complexity theory , computer algebra and other areas of computer algebra.
Slissenko studied at the Leningrad State University with a diploma in 1963 and received his doctorate in 1967 with Nikolai Alexandrowitsch Schanin at the Steklov Institute in Leningrad (dissertation: Regulators of the convergence of constructive consequences and regulators of the continuity of constructive functions (Russian)) and his habilitation in 1981 (Russian Doctorate). From 1967 to 1992 he was head of the Leningrad Complexity Theory Seminar and from 1981 to 1993 he headed the Laboratory for Algorithmic Theory of the Leningrad Institute of Computer Science and Automation of the Russian Academy of Sciences. He was also a part-time professor at the Leningrad Polytechnic Institute from 1981 to 1987 and at the Leningrad State University from 1988 to 1992, where he headed the Faculty of Computer Science.
From 1993 to 2009 he was a professor at the University of Paris XII . He has been Professor Emeritus there since 2009. There he headed the Laboratory for Algorithmic Complexity and Logic (LACL) from 1997 to 2007.
In addition to complexity theory (including a Turing machine with six read / write heads that recognizes palindromes in real time at the beginning of the 1970s) and algorithms (including real-time algorithms at the end of the 1970s that find all periodicities of a word in compact form and classic string Solving matching problems ) also with automatic proof systems (1960s), recursive (constructive) theory of real functions, graph grammars (a certain type of which is named after him, for the description of poly-time classes of difficult problems), probabilistic methods in the theoretical computer science (entropy-like concepts for algorithm analysis and knowledge representation), complexity of Markov decision processes, fault tolerance of syntax and verification of real-time systems and distributed systems.
In 1983 he was invited speaker at the International Congress of Mathematicians in Warsaw (Linguistic considerations in deriving effective algorithms) .
Dmitri Jurjewitsch Grigoryev is one of his doctoral students .
Fonts (selection)
- Complexity problems in computational theory, Russian Mathematical Surveys, Volume 36, 1981, pp. 23-125
- Recognizing a symmetry predicate by multihead Turing machines with input. Proc. Steklov Inst. Of Mathematics, AMS, Vol. 129, 1976, pp. 25-208
- Detection of periodicities and string-matching in real time. J. of Soviet Mathematics, Volume 22, 1983, pp. 1316-1386
- Context-free grammars as a tool for describing polynomial-time subclasses of hard problems. Inform. Process. Lett., Vol. 14, 1982, pp. 52-56
- with Danièle Beauquier: A first order logic for specification of timed algorithms: basic properties and a decidable class. Annals of Pure and Applied Logic, Vol. 113, 2002, pp. 13-52
- with J. Heintz, T. Krick, P. Solerno: Finding shortest paths around semi-algebraic obstacles in the plane, J. of Math. Sci., Volume 70, 1994, pp. 1944-1949
- with D. Grigoriev: Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane, St. Petersburg Math. J., Volume 10, 1999, pp. 315-332
- On measures of information quality of knowledge processing systems. Information Sciences: An International Journal, Vol. 57/58, 1991, pp. 389-402
- On entropic convergence of algorithms in terms of domain partitions, Arxiv 2016
Web links
Individual evidence
- ↑ Anatol Olesjewitsch Slissenko in the Mathematics Genealogy Project (English)
| personal data | |
|---|---|
| SURNAME | Slissenko, Anatol Olesjewitsch |
| ALTERNATIVE NAMES | Slisenko, Anatol; Слисенко, Анатоль Олесьевич |
| BRIEF DESCRIPTION | Russian mathematician |
| DATE OF BIRTH | August 15, 1941 |