The AVL tree, a foundational data structure in computer science, derives its name from the collaboration between Evgenii Landis and Georgy Adelson-Velsky. Operating within the intersection of mathematics and informatics, Landis spent his career navigating the complexities of differential equations and algorithmic efficiency while based at the Lomonosov Moscow State University in the Soviet Union.
Academic Foundation and Early Research
Born in Kharkiv in 1921, Evgenii Mikhailovich Landis completed his education at the MSU Faculty of Mechanics and Mathematics. His academic trajectory was influenced by advisors Alexander Kronrod and Ivan Petrovsky. In 1946, working alongside Kronrod, Landis rediscovered Sard's lemma, a result that had remained obscure within the Soviet Union until that point. This period marked the beginning of his focus on analytical methods and the theoretical underpinnings of his field.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Contributions to Differential Calculus
Landis established a research program centered on partial differential equations. His work explored uniqueness theorems for both elliptic and parabolic differential equations, alongside investigations into Harnack inequalities and Phragmén–Lindelöf type theorems. These studies contributed to the broader field of analysis, reflecting the shift toward increased abstraction and specialization in twentieth-century mathematics. His tenure at Lomonosov Moscow State University facilitated his influence on the next generation, including students such as Yulij Ilyashenko and Boris Katz.
Military Service and Final Years
Beyond his mathematical pursuits, Landis held several military honors, including the Order of the Red Star, the Order of the Patriotic War, 2nd class, and the Medal for Battle Merit. These decorations recognize his service during a period of significant geopolitical instability in Russia. Landis continued his academic duties until his death in 1997. He is buried at the Vostryakovo Cemetery in Moscow.
Fast facts
- Born: 1921, Kharkiv
- Died: 1997, Moscow
- Primary Institution: Lomonosov Moscow State University
- Academic Degree: Doctor of Sciences in Physics and Mathematics
- Notable Invention: AVL tree
- Military Honors: Order of the Red Star, Order of the Patriotic War (2nd class), Medal for Battle Merit
- Languages: English, Russian
Questions readers ask
What is the AVL tree?
It is a self-balancing binary search tree data structure invented by Evgenii Landis and Georgy Adelson-Velsky.
Where did Evgenii Landis conduct his research?
He was employed at the Lomonosov Moscow State University, where he also completed his studies.
Achievements
- Order of the Red Star
- Medal "For Battle Merit"
- Order of the Patriotic War, 2nd class
- Notable work: AVL tree
- Held posts at Lomonosov Moscow State University
- Fields: differential calculus, partial differential equation and mathematics
