Jump to: navigation, search

Georgy Adelson-Velsky

4 bytes removed, 23:08, 9 April 2018
no edit summary
was a Soviet and Israeli mathematician, computer scientist and computer chess pioneer, most famous for inventing the [ AVL tree] along with [[Mathematician#Landis|Evgenii Landis]] <ref>Georgy Adelson-Velsky, [[Mathematician#Landis|Evgenii Landis]] ('''1962'''). ''An algorithm for the organization of information''. [ Proceedings of the USSR Academy of Sciences], (Russian) English translation by Myron J. Ricci in [ Soviet Mathematics Doklady], No. 3</ref>, and as co-author of the [[ITEP Chess Program]] and [[Kaissa]]. Adelson-Velsky and his fellow [[Alexander Kronrod]] were the last students of [[Mathematician#Luzin|Nikolai Luzin]] at [[Moscow State University]], where he graduated in 1949 under [[Mathematician#Gelfand|Israel Gelfand]] on ''Spectral Analysis of Ring of Bounded Linear Operators'' <ref>[ The Mathematics Genealogy Project - Georgiy Adelson-Velsky]</ref> <ref>[ Interview with Georgy Adelson-Velsky] (pdf) by [[Mathematician#Dynkin|Eugene Dynkin]], Moscow, September 1, 1990 </ref>.
In the 90s, Adelson-Velsky emigrated to Israel and lived in [ Ashdod] <ref>[ Georgi Maximowitsch Adelson-Welski -] (German)</ref>, at times affiliated with the [ Technion], and Mathematics & Computer Science department of [[Bar-Ilan University]] <ref>[ Kaissa & Botvinik] by [[Shay Bushinsky]], [[Computer Chess Forums|rgcc]], October 16, 1997</ref>. Georgy Adelson-Velsky died on April 26, 2014, aged 92, in [ Giv'atayimGivatayim Givatayim], Israel <ref>[ Georgy Adelson-Velsky from Wikipedia]</ref> <ref>[ Misha Furman - RIP: Георгий Максимович Адельсон-Вельский], April 26, 2014</ref>.
=Computer Chess=

Navigation menu