Age, Biography and Wiki
Anatol Slissenko was born on 15 August, 1941 in USSR, is a Soviet, Russian and French mathematician. Discover Anatol Slissenko's Biography, Age, Height, Physical Stats, Dating/Affairs, Family and career updates. Learn How rich is he in this year and how he spends money? Also learn how he earned most of networth at the age of 82 years old?
| Popular As |
N/A |
| Occupation |
N/A |
| Age |
82 years old |
| Zodiac Sign |
Leo |
| Born |
15 August, 1941 |
| Birthday |
15 August |
| Birthplace |
USSR |
| Nationality |
Russia
|
We recommend you to check the complete list of Famous People born on 15 August.
He is a member of famous mathematician with the age 82 years old group.
Anatol Slissenko Height, Weight & Measurements
At 82 years old, Anatol Slissenko height not available right now. We will update Anatol Slissenko's Height, weight, Body Measurements, Eye Color, Hair Color, Shoe & Dress size soon as possible.
| Physical Status |
| Height |
Not Available |
| Weight |
Not Available |
| Body Measurements |
Not Available |
| Eye Color |
Not Available |
| Hair Color |
Not Available |
Dating & Relationship status
He is currently single. He is not dating anyone. We don't have much information about He's past relationship and any previous engaged. According to our Database, He has no children.
| Family |
| Parents |
Not Available |
| Wife |
Not Available |
| Sibling |
Not Available |
| Children |
Not Available |
Anatol Slissenko Net Worth
His net worth has been growing significantly in 2023-2024. So, how much is Anatol Slissenko worth at the age of 82 years old? Anatol Slissenko’s income source is mostly from being a successful mathematician. He is from Russia. We have estimated Anatol Slissenko's net worth, money, salary, income, and assets.
| Net Worth in 2024 |
$1 Million - $5 Million |
| Salary in 2024 |
Under Review |
| Net Worth in 2023 |
Pending |
| Salary in 2023 |
Under Review |
| House |
Not Available |
| Cars |
Not Available |
| Source of Income |
mathematician |
Anatol Slissenko Social Network
| Instagram |
|
| Linkedin |
|
| Twitter |
|
| Facebook |
|
| Wikipedia |
|
| Imdb |
|
Timeline
Anatol Slissenko (Анатолий Олесьевич Слисенко ) (born August 15, 1941) is a Soviet, Russian and French mathematician and computer scientist.
Among his research interests one finds automatic theorem proving, recursive analysis, computational complexity, algorithmics, graph grammars, verification, computer algebra, entropy and probabilistic models related to computer science.
Anatol Slissenko was born in Siberia, where his father served as head of a regiment of military topography.
He graduated from the Leningrad State University, Faculty of Mathematics and Mechanics in 1963 (honors diploma).
During 1963–1981 he was with the Leningrad Department of Steklov Institute of Mathematics of the USSR Academy of Sciences (LOMI).
He earned his PhD (candidate of sciences, his adviser was Nikolai Aleksandrovich Shanin) in 1967 from the Leningrad Department of Steklov Institute of Mathematics, and his Doctor of Science (higher doctorate) in 1981 from the Steklov Institute of Mathematics in Moscow.
From 1967 till 1992 he headed the Leningrad Seminar on Computational Complexity that played an important role in the development of this field in the Soviet Union.
During 1981–1993 he was the head of Laboratory of Theory of Algorithms at the Leningrad Institute for Informatics and Automation of the USSR Academy of Sciences.
In 1981–1987 he was a part-time professor of the Leningrad Polytechnical Institute, and during 1988–1992 he was a professor and head of the Department of Computer Science at Leningrad State University, Faculty of Mathematics and Mechanics, whose creation he initiated (the teams of the Department were world champions of ACM International Collegiate Programming Contest four times).
Slissenko was invited as a speaker at many conferences, in particular at International Congress of Mathematicians in 1983, in Warsaw, Poland.
Among his results one can mention a six-head one-tape Turing machine that recognizes palindromes in real-time, an algorithm (for a kind of pointer machine) that solves in real-time a large variety of string-matching problems (including finding of all periodicities in a compact form), Slissenko graph-grammars (that describe classes of NP-hard problems solvable in polytime), decidable classes of verification of hard-real-time controllers, algorithms for constructing shortest paths among semi-algebraic obstacles, and entropy-like concepts for analysis of algorithms and inference systems.
He collaborated with N.Shanin, S.Maslov, G.Mints and V.Orevkov on automatic theorem proving, and with D.Beauquier D.Grigoriev, D.Burago, A.Rabinovich, P. Vasilyev and others on some algorithmic problems, see.
From 1993 until 2009 he was a full professor of the University Paris-Est Créteil, France, and since 2009 he remains professor emeritus of this university.
He had also been head (and in a way a founder) of Laboratory for Algorithmics Complexity and Logic from 1997 until 2007.
