Rafail Krichevskii

Rafail Evseevich Krichevskii (Рафаил Евсеевич Кричевский, sometimes transliterated as "Krichevskiy" or "Krichevsky", born 1936, Kharkov) is a Russian mathematician and information theorist, now living in the United States.

He graduated from Moscow State University in 1958. He became a doctor of physical and mathematical sciences and professor, specializing in the field of mathematical cybernetics and information theory. From 1961 to 1996 he worked at the Sobolev Institute of Mathematics. He supervised 7 doctoral (Russian candidate degree) students and 2 higher doctoral (habilitation) students. He is the author of about 80 scientific papers.[1][2]

In 1986 Krichevskii was an Invited Speaker with talk Retrieval and data compression complexity at the ICM in Berkeley, California.[3]

Selected publications

  • with B. Ya Ryabko and A. Yu Haritonov: "Optimal key for taxons ordered in accordance with their frequencies." Discrete Applied Mathematics 3, no. 1 (1981): 67–72. doi:10.1016/0166-218X(81)90029-9
  • with Vladimir Potapov: "Compression and restoration of square integrable functions." Electron. Res. Announc. Amer. Math. Soc. 2 (1996), 42–49. doi:10.1090/S1079-6762-96-00005-4

References

  1. ↑ "Рафаил Евсеевич Кричевский". librusec.pro.
  2. ↑ "Кричевский Рафаил Евсеевич". prometeus.nsc.ru.
  3. ↑ Krichevsky, R. "Retrieval and data compression". Proceedings of the International Congress of Mathematicians (Berkeley, 1986). p. 1461.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.