# Georgy Adelson-Velsky

> Russian mathematician (1922–2014)

**Wikidata**: [Q92968](https://www.wikidata.org/wiki/Q92968)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Georgy_Adelson-Velsky)  
**Source**: https://4ort.xyz/entity/georgy-adelson-velsky

## Summary
Georgy Adelson-Velsky was a Russian mathematician and computer scientist (1922–2014) known for his contributions to algorithms and data structures, particularly the AVL tree, which he developed with his student Evgeny Landis.

## Biography
- Born: 1922-01-08 in Samara, Russia
- Nationality: Soviet Union, Israel
- Education: MSU Faculty of Mechanics and Mathematics, Lomonosov Moscow State University
- Known for: Development of the AVL tree algorithm with Evgeny Landis
- Employer(s): Institute for Theoretical and Experimental Physics (from 1965), Bar-Ilan University
- Field(s): Mathematics, computer science

## Contributions
Georgy Adelson-Velsky is most famous for co-developing the AVL tree, a self-balancing binary search tree algorithm with Evgeny Landis in 1962. This data structure maintains balance after insertions and deletions, ensuring O(log n) time complexity for search operations. His work on algorithms and data structures has had lasting impact on computer science, particularly in database systems and information retrieval. He also contributed to theoretical aspects of mathematics and artificial intelligence.

## FAQs
### Q: What is Georgy Adelson-Velsky most famous for?
A: He is most famous for co-developing the AVL tree, a self-balancing binary search tree algorithm with Evgeny Landis.

### Q: Where did he work?
A: He worked at the Institute for Theoretical and Experimental Physics in Moscow starting in 1965 and later at Bar-Ilan University.

### Q: What was his field of study?
A: He worked primarily in mathematics and computer science, with contributions to algorithms, data structures, and artificial intelligence.

## Why They Matter
The AVL tree algorithm developed by Adelson-Velsky and Landis revolutionized how data is organized and searched in computer systems. By maintaining balance automatically, it ensured optimal performance for large datasets, which became fundamental to database systems, file systems, and various software applications. His work established standards for efficient data management that are still used in modern computing.

## Notable For
- Co-developed the AVL tree algorithm with Evgeny Landis (1962)
- Worked at the Institute for Theoretical and Experimental Physics in Moscow
- Affiliated with Bar-Ilan University
- Contributed to theoretical mathematics and artificial intelligence
- Received academic recognition including professorship and doctoral advisor status

## Body
### Early Life and Education
Georgy Maximovich Adelson-Velsky was born on January 8, 1922, in Samara, Russia. He studied at the MSU Faculty of Mechanics and Mathematics and later at Lomonosov Moscow State University. His doctoral advisor was Israel Gelfand.

### Career and Research
Adelson-Velsky began his career at the Institute for Theoretical and Experimental Physics in Moscow in 1965. He later became affiliated with Bar-Ilan University. His research focused on algorithms and data structures, with his most significant contribution being the AVL tree algorithm.

### The AVL Tree
In 1962, Adelson-Velsky and his student Evgeny Landis published their work on the AVL tree, a self-balancing binary search tree. The algorithm ensures that the tree remains balanced after insertions and deletions, maintaining O(log n) time complexity for search operations. This work addressed the problem of unbalanced trees that could degrade to linear time performance.

### Legacy
Adelson-Velsky's work on the AVL tree established fundamental principles for efficient data storage and retrieval. His contributions influenced subsequent developments in computer science, particularly in database management systems and information retrieval technologies. The algorithm remains a standard in computer science education and practical applications.

### Professional Affiliations
Throughout his career, Adelson-Velsky maintained academic positions at prestigious institutions. His work at the Institute for Theoretical and Experimental Physics connected theoretical research with practical applications in computing. His later affiliation with Bar-Ilan University demonstrated his continued influence in academic circles.

### Recognition
As a professor and doctoral advisor, Adelson-Velsky contributed to the training of future computer scientists. His publications and research have been recognized through various academic identifiers including ISNI, GND, VIAF, and others.

```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Georgy Adelson-Velsky",
  "jobTitle": "Mathematician, Computer Scientist",
  "worksFor": {
    "@type": "Organization",
    "name": "Institute for Theoretical and Experimental Physics"
  },
  "nationality": {
    "@type": "Country",
    "name": "Russia"
  },
  "birthDate": "1922-01-08",
  "birthPlace": {
    "@type": "Place",
    "name": "Samara, Russia"
  },
  "alumniOf": [
    {
      "@type": "EducationalOrganization",
      "name": "MSU Faculty of Mechanics and Mathematics"
    },
    {
      "@type": "EducationalOrganization",
      "name": "Lomonosov Moscow State University"
    }
  ],
  "knowsAbout": [
    "Mathematics",
    "Computer Science",
    "Algorithms",
    "Data Structures"
  ],
  "sameAs": [
    "https://www.wikidata.org/wiki/Q54919",
    "https://en.wikipedia.org/wiki/Georgy_Adelson-Velsky"
  ],
  "description": "Russian mathematician and computer scientist known for developing the AVL tree algorithm with Evgeny Landis"
}

## References

1. Mathematics Genealogy Project
2. Virtual International Authority File
3. CiNii Research
4. Freebase Data Dumps. 2013