Rafail Krichevskii | |
|---|---|
| Рафаил Евсеевич Кричевский | |
 | |
| Born | October 12, 1936 Kharkov, Ukraina (former USSR) |
| Alma mater | Moscow State University |
| Scientific career | |
| Fields | information theory, computer science |
| Institutions | Sobolev Institute of Mathematics, University of California, Riverside |
| Doctoral advisor | Sergey Yablonsky |
Rafail Evseevich Krichevskii (Рафаил Евсеевич Кричевский, sometimes transliterated as "Krichevskiy" or "Krichevsky", born October 12, 1936, Kharkov) is a Russian mathematician and information theorist, now living in the United States.
He graduated from Moscow State University in 1958. He received his PhD degree in Theoretical Cybernetics in 1963. His PhD advisor was S.V.Yablonsky. Further, Krichevskii became a doctor of physical and mathematical sciences (1988) and professor (1991), specializing in the field of mathematical cybernetics and information theory. From 1962 to 1996 he worked at the Sobolev Institute of Mathematics. In the late 90s he worked in University of California, Riverside, US.
His main publications are in the fields of universal source coding, optimal hashing, combinatorial retrieval and error-correcting codes.
Krichevsky–Trofimov estimator is widely used in source coding and bioinformatics.
He supervised 5 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]
- ^ "Рафаил Евсеевич Кричевский". librusec.pro.
- ^ "Кричевский Рафаил Евсеевич". prometeus.nsc.ru.
- ^ Krichevsky, R. "Retrieval and data compression". Proceedings of the International Congress of Mathematicians (Berkeley, 1986). p. 1461.