63
edits
Changes
→Official Information
=Quotes=
==Official Information==
by [[Mikhail Donskoy]] (1999) on [[Kaissa]] <ref>[httphttps://www.computer-museum.ru/histsoftgames/kaissa1.htm История “Каиссы” Михаил Донской] from [[Russian Virtual Computer Museum]] (no longer available) translated with the help of [https://en.wikipedia.org/wiki/Babel_Fish_%28website%29 Babel Fish] and [http://www.online-translator.com/text_Translation.aspx promt translator]</ref>
Georgy Adelson-Velsky - one of the first Soviet programmers (together with [[Alexander Kronrod]], [[Alexander Brudno]], [[Mathematician#Landis|Evgenii Landis]] and others). He was occupied by the programs, connected with [https://en.wikipedia.org/wiki/Nuclear_physics nuclear physics] at [[Institute of Theoretical and Experimental Physics|ITEP]], where he devised many algorithms which became classical. Especially the equilibrium binary trees, which in the entire world are called [https://en.wikipedia.org/wiki/AVL_tree AVL trees] after the names of the authors - Adelson-Velsky and Landis. After short-term teaching at [[Moscow State University|MGU]] he worked at IPU and VNIISI (All-Union Scientific Research Institute of Sanitary Testing) on discrete algorithms, [https://en.wikipedia.org/wiki/Network_planning_and_design network planning] and [[Artificial Intelligence|artificial intelligence]]. He now lives in Israel and works at [https://en.wikipedia.org/wiki/Technion_%E2%80%93_Israel_Institute_of_Technology Technion] on [https://en.wikipedia.org/wiki/NP_%28complexity%29 NP problems of complete tasks].
