Evgenii Mikhailovich Landis (Russian : Евге́ний Миха́йлович Ла́ндис, Yevgeny Mikhaylovich Landis; 6 October 1921 – 12 December 1997) was a Soviet mathematician who worked mainly on partial differential equations.
Evgenii Mikhailovich Landis (Russian : Евге́ний Миха́йлович Ла́ндис, Yevgeny Mikhaylovich Landis; 6 October 1921 – 12 December 1997) was a Soviet mathematician who worked mainly on partial differential equations.
Landis was born in Kharkiv, Ukrainian SSR, Soviet Union. He was Jewish. He studied and worked at the Moscow State University, where his advisor was Alexander Kronrod, and later Ivan Petrovsky. In 1946, together with Kronrod, he rediscovered Sard's lemma, unknown in USSR at the time.
Later, he worked on uniqueness theorems for elliptic and parabolic differential equations, Harnack inequalities, and Phragmén–Lindelöf type theorems. With Georgy Adelson-Velsky, he invented the AVL tree data structure (where "AVL" stands for Adelson-Velsky Landis).
He died in Moscow. His students include Yulij Ilyashenko.
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
 | This article about a Ukrainian mathematician is a stub. You can help Wikipedia by expanding it. |
In computer science, an AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases, where is the number of nodes in the tree prior to the operation. Insertions and deletions may require the tree to be rebalanced by one or more tree rotations.
In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree. The time complexity of operations on the binary search tree is linear with respect to the height of the tree.
Prof Sergei Lvovich Sobolev, FRSE was a Soviet mathematician working in mathematical analysis and partial differential equations.
Lev Semyonovich Pontryagin was a Soviet mathematician. Completely blind from the age of 14, he made major discoveries in a number of fields of mathematics, including algebraic topology, differential topology and optimal control.
Andrey Nikolayevich Tikhonov was a leading Soviet Russian mathematician and geophysicist known for important contributions to topology, functional analysis, mathematical physics, and ill-posed problems. He was also one of the inventors of the magnetotellurics method in geophysics. Other transliterations of his surname include "Tychonoff", "Tychonov", "Tihonov", "Tichonov".
Sergei Natanovich Bernstein was a Ukrainian and Russian mathematician of Jewish origin known for contributions to partial differential equations, differential geometry, probability theory, and approximation theory.
Georgy Maximovich Adelson-Velsky was a Soviet mathematician and computer scientist.
Mark Aronovich Naimark was a Soviet mathematician who made important contributions to functional analysis and mathematical physics.
Mark Aleksandrovich Krasnoselsky was a Soviet and Russian mathematician renowned for his work on nonlinear functional analysis and its applications.
Ivan Georgiyevich Petrovsky was a Soviet mathematician working mainly in the field of partial differential equations. He greatly contributed to the solution of Hilbert's 19th and 16th problems, and discovered what are now called Petrovsky lacunas. He also worked on the theories of boundary value problems, probability, and on the topology of algebraic curves and surfaces.
Aleksandr Semyonovich Kronrod was a Soviet mathematician and computer scientist, best known for the Gauss–Kronrod quadrature formula which he published in 1964. Earlier, he worked on computational solutions of problems emerging in theoretical physics. He is also known for his contributions to economics, specifically for proposing corrections and calculating price formation for the USSR. Later, Kronrod gave his fortune and life to medicine to care for terminal cancer patients. Kronrod is remembered for his captivating personality and was admired as a student, teacher and leader.
Sergei Konstantinovich Godunov was a Soviet and Russian professor at the Sobolev Institute of Mathematics of the Russian Academy of Sciences in Novosibirsk, Russia.
Kotok-McCarthy also known as A Chess Playing Program for the IBM 7090 Computer was the first computer program to play chess convincingly. It is also remembered because it played in and lost the first chess match between two computer programs. A pseudocode of the program is in Figure 11.15 of.
Vladimir Grigorevich Boltyansky, also transliterated as Boltyanski, Boltyanskii, or Boltjansky, was a Soviet and Russian mathematician, educator and author of popular mathematical books and articles. He was best known for his books on topology, combinatorial geometry and Hilbert's third problem.
Vladimir L’vovich Arlazarov (Russian: Арлазаров Владимир Львович) is a Russian computer scientist born in Moscow.
Yulij Sergeevich Ilyashenko is a Russian mathematician, specializing in dynamical systems, differential equations, and complex foliations.
Andrey Albertovich Muchnik was a Soviet and Russian mathematician who practiced mathematical logic. He was awarded the A. N. Kolmogorov Prize in 2006.
Yefim Dinitz is a Soviet and Israeli computer scientist associated with the Moscow school of polynomial-time algorithms. He invented Dinic's algorithm for computing maximal flow, and he was one of the inventors of the Four Russians' algorithm for multiplying Boolean or mod 2 matrices.
