-
Georgy Maximovich Adelson-
Velsky (Russian: Гео́ргий Макси́мович Адельсо́н-Ве́льский; name is
sometimes transliterated as
Georgii Adelson-Velskii) (8 January...
-
Velsky (masculine),
Velskaya (feminine), or
Velskoye (neuter) may
refer to:
Velsky District, a
district of
Arkhangelsk Oblast Velsky Uyezd, an administrative...
-
studied for a master's
degree in
Georgy Adelson-
Velsky's group at
Moscow State University. In 1969, Adelson-
Velsky started a
seminar on algorithms,
which his...
- 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...
-
Velsky Uyezd (Russian: Вельский уезд) was one of the
subdivisions of the
Vologda Governorate of the
Russian Empire. It was
situated in the
western part...
-
Algorithms (3rd ed.), Addison–Wesley, p. 343, ISBN 978-0-201-89683-1 Adelson-
Velsky, Georgy; Landis,
Evgenii (1962), "An
algorithm for the
organization of information"...
- self-balancing
binary search trees,
invented in 1962 by
Georgy Adelson-
Velsky and
Evgenii Landis.
Binary search trees can be used to
implement abstract...
- station,
Australia AVL tree, a data
structure named after inventors Adelson-
Velsky and
Landis that is used in
computer programming American Vampire League...
-
Velsky District (Russian: Ве́льский райо́н) is an
administrative district (raion), one of the twenty-one in
Arkhangelsk Oblast, Russia. As a muni****l...
- In
computer science, an AVL tree (named
after inventors Adelson-
Velsky and Landis) is a self-balancing
binary search tree. In an AVL tree, the heights...
