Question: What do Georgy Adelson-Velsky and Leonid Levin have in common?

full_context: Document 1: Nicolai V. Krylov: Nicolai Vladimirovich Krylov (Russian: Никола́й Влади́мирович Крыло́в ; born 5 June 1941) is a Russian mathematician specializing in partial differential equations, particularly stochastic partial differential equations and diffusion processes. Krylov studied at Lomonosov University, where he in 1966 under E. B. Dynkin attained a doctoral candidate title (similar to a PhD) and in 1973 a Russian doctoral degree (somewhat more prestigious than a PhD). He taught from 1966 to 1990 at the Lomonosov University and is since 1990 a professor at the University of Minnesota. At the beginning of his career (starting from 1963) he, in collaboration with Dynkin, worked on nonlinear stochastic control theory, making advances in the study of convex, nonlinear partial equations of 2nd order ("i.e." Bellman equations), which were examined with stochastic methods. This led to the Evans-Krylov theory, for which he received with Lawrence C. Evans in 2004 the Leroy P. Steele Prize of the American Mathematical Society (for work done simultaneously and independently by both Krylov and Evans). They proved the second order differentiability (Hölder continuity of the second derivative) of the solutions of convex, completely nonlinear, second order elliptical partial differential equations and thus the existence of "classical solutions" (Theorem of Evans-Krylov). He was in 1978 at Helsinki and in 1986 at Berkeley an Invited Speaker for the ICM. He received the Humboldt Research Award in 2001. In 1993 he was elected a member of the American Academy of Arts and Sciences (1993). He should not be confused with the mathematician Nikolay M. Krylov.
Document 2: Nikolay Brusentsov: Nikolay Petrovich Brusentsov (Russian: Никола́й Петро́вич Брусенцо́в ; 7 February 1925 in Kamenskoe, Ukrainian SSR – 4 December 2014) was a Russian computer scientist, most famous for having built a (balanced) ternary computer, Setun, together with Sergei Sobolev in 1958.
Document 3: Aleksandr Danilovich Aleksandrov: Aleksandr Danilovich Aleksandrov (Russian: Алекса́ндр Дани́лович Алекса́ндров , alternative transliterations: "Alexandr" or "Alexander" (first name), and "Alexandrov" (last name)) (August 4, 1912 – July 27, 1999), was a Soviet/Russian mathematician, physicist, philosopher and mountaineer.
Document 4: Alexander Razborov: Aleksandr Aleksandrovich Razborov (Russian: Алекса́ндр Алекса́ндрович Разбо́ров ; born February 16, 1963), sometimes known as Sasha Razborov, is a Soviet and Russian mathematician and computational theorist.
Document 5: Georgy Adelson-Velsky: Georgy Maximovich Adelson-Velsky (Russian: Гео́ргий Макси́мович Адельсо́н-Ве́льский ; name is sometimes transliterated as Georgii Adelson-Velskii) (8 January 1922 – 26 April 2014) was a Soviet and Israeli mathematician and computer scientist.
Document 6: Andrey Kolmogorov: Andrey Nikolaevich Kolmogorov (Russian: Андрей Николаевич Колмогоров ; ] , 25 April 1903 – 20 October 1987) was a 20th-century Soviet mathematician who made significant contributions to the mathematics of probability theory, topology, intuitionistic logic, turbulence, classical mechanics, algorithmic information theory and computational complexity.
Document 7: Alexander Gelfond: Alexander Osipovich Gelfond (Russian: Алекса́ндр О́сипович Ге́льфонд ; 24 October 1906 – 7 November 1968) was a Soviet mathematician. Gelfond's theorem is named after him.
Document 8: Israel Gelfand: Israel Moiseevich Gelfand, also written Israïl Moyseyovich Gel'fand, or Izrail M. Gelfand (Yiddish: ישראל געלפֿאַנד‎ , Russian: Изра́иль Моисе́евич Гельфа́нд ; 2 September [O.S. 20 August] 1913 – 5 October 2009) was a prominent Soviet mathematician. He made significant contributions to many branches of mathematics, including group theory, representation theory and functional analysis. The recipient of many awards, including the Order of Lenin and the Wolf Prize, he was a Fellow of the Royal Society and professor at Moscow State University and, after immigrating to the United States shortly before his 76th birthday, at Rutgers University.
Document 9: Boris Galerkin: Boris Grigoryevich Galerkin (Russian: Бори́с Григо́рьевич Галёркин , surname more accurately romanized as Galyorkin; 4 March [O.S. 20 February] 1871  – 12 July 1945), born in Polotsk, Vitebsk Governorate, Russian Empire, was a Jewish Soviet mathematician and an engineer.
Document 10: Yuri Manin: Yuri Ivanovitch Manin (Russian: Ю́рий Ива́нович Ма́нин ; born 1937) is a Soviet/Russian/German mathematician, known for work in algebraic geometry and diophantine geometry, and many expository works ranging from mathematical logic to theoretical physics. Moreover, Manin was one of the first to propose the idea of a quantum computer in 1980 with his book "Computable and Uncomputable".
Document 11: Albert Vexler: Albert Vexler was born in Birobidzhan, The Jewish Autonomous Oblast, USSR on 23 September 1971. His Ph.D. degree in Statistics and Probability Theory was obtained from the Hebrew University of Jerusalem in 2003. His Ph.D. advisor was Marcy Bogen Professor, Fellow of the American Statistical Association. Dr. Vexler was a postdoctoral research fellow in the Biometry and Mathematical Statistics Branch at the National Institute of Child Health and Human Development. Currently, Dr. Vexler is a tenured Associate Professor at the State University of New York at Buffalo, Department of Biostatistics. Dr. Vexler has authored and co-authored various publications that contribute to both the theoretical and applied aspects of statistics. His papers and statistical software developments have appeared in statistical and biostatistical journals, which have the top rated impact factors and are historically recognized as the leading scientific journals. Dr. Vexler was awarded a National Institutes of Health (NIH) grant to develop novel nonparametric data analysis and statistical methodology. The results of this effort can be found via a public access resource housed by the US National Library of Medicine.
Document 12: Leonid Levin: Leonid Anatolievich Levin ( ; Russian: Леони́д Анато́льевич Ле́вин ; Ukrainian: Леоні́д Анато́лійович Ле́він ; born November 2, 1948) is a Soviet-American computer scientist.
Document 13: Steven Rudich: Steven Rudich (born October 4, 1961) is a professor in the Carnegie Mellon School of Computer Science. In 1994, he and Alexander Razborov proved that a large class of combinatorial arguments, dubbed natural proofs were unlikely to answer many of the important problems in computational complexity theory. For this work, they were awarded the Gödel prize in 2007. He also co-authored a paper demonstrating that all currently known NP-complete problems remain NP-complete even under AC or NC reductions.
Document 14: Georgy Voronoy: Georgy Feodosevich Voronoy (Ukrainian: Георгій Феодосійович Вороний ; Russian: Гео́ргий Феодо́сьевич Вороно́й ; 28 April 1868 – 20 November 1908) was a Russian and Ukrainian mathematician. Among other things, he defined the Voronoi diagram.
Document 15: Yuri Matiyasevich: Yuri Vladimirovich Matiyasevich, (Russian: Ю́рий Влади́мирович Матиясе́вич ; born March 2, 1947, in Leningrad) is a Russian mathematician and computer scientist. He is best known for his negative solution of Hilbert's tenth problem (Matiyasevich's theorem), which was presented in his doctoral thesis at LOMI (the Leningrad Department of the Steklov Institute of Mathematics).
ground_truth: computer scientist