What is Yuri Zhuravlyov (mathematician)?
{{Infobox scientist | name = Yury Zhuravlev | image = Zhuravlev 001.jpg | image_size = | caption = | birth_date = {{birth date|1935|01|14|df=y}} | birth_place = [[Voronezh]], [[Russian SFSR]], [[Soviet Union]] | death_date = {{death date and age|2022|1|14|1935|1|14|df=y}} | death_place = [[Moscow]], Russia | nationality = Russian | fields = [[Mathematics]] | workplaces = [[Dorodnitsyn Computing Centre]], [[Moscow State University]] | alma_mater = [[Moscow State University]] | doctoral_advisor = | doctoral_students = | known_for = | awards = | education = }} '''Yuri Ivanovich Zhuravlyov''' ({{lang-ru|Юрий Иванович Журавлёв}}; 14 January 1935 – 14 January 2022) was a Russian [[mathematician]]. Zhuravlev was a full member of the [[Russian Academy of Sciences]] since 1992. He was also the [[Editor-in-Chief]] of the international journal ''[[Pattern Recognition and Image Analysis]]''. In 1953, under the guidance of Alexey Andreevich Lyapunov, Yuriy Ivanovich completed his first serious scientific work on minimizing partially defined Boolean functions. This work was published in the “Proceedings of the MIAN,” and in 1955, it won first prize in the All-Union Student Research Competition. His diploma work involved solving the problem of finding words in a finite set while considering the unique structure of the set. After defending his thesis in 1957, he entered graduate school at Moscow State University, where he worked with A.A. Lyapunov in the department led by Academician Sergey Lvovich Sobolev. Working on a practical problem of testing a wide class of technical devices, Zhuravlev developed a special mathematical approach that later inspired numerous studies by both Soviet and international scientists. While studying the problem of locality in discrete tasks, he introduced a topological concept of “neighborhood” in Boolean function minimization, leading to several classical results