Vladimir Levenshtein

Vladimir Levenshtein
Born Vladimir Iosifovich Levenshtein
(1935-05-20) 20 May 1935
Residence Moscow, Russia
Citizenship Russia
Nationality Russian Jewish
Fields Mathematics
Alma mater Moscow State University
Known for Levenshtein distance
Levenshtein automaton
Levenshtein coding
Notable awards IEEE Richard W. Hamming Medal (2006)

Vladimir Iosifovich Levenshtein (Russian: Влади́мир Ио́сифович Левенште́йн; IPA: [vlɐˈdʲimʲɪr ɪˈosʲɪfəvʲɪtɕ lʲɪvʲɪnˈʂtʲejn]; born 1935) is a Russian scientist who has done research in information theory, error-correcting codes, and combinatorial design. Among other contributions, he is known for the Levenshtein distance and a Levenshtein algorithm, which he developed in 1965.

He graduated from the Department of Mathematics and Mechanics of Moscow State University in 1958 and has worked at the Keldysh Institute of Applied Mathematics in Moscow ever since. He is a fellow of the IEEE Information Theory Society.

He received the IEEE Richard W. Hamming Medal in 2006, for “contributions to the theory of error-correcting codes and information theory, including the Levenshtein distance”.[1]

There is a controversy in regard to the publication date of the paper where the Levenshtein distance was introduced. The original, Russian, version was published in 1965,[2] but the translation appeared in 1966.[3][4]

Publications

See also

References

  1. ↑ "IEEE Richard W. Hamming Medal Recipients" (PDF). IEEE. Retrieved May 29, 2011.
  2. ↑ "The list of publications on the web page of V. Levenshtein".
  3. ↑ "The bibliographic entry for the translated article, originally published in 1965".
  4. ↑ "The scanned version of the translated paper by V. Levenshtein." (PDF).
This article is issued from Wikipedia - version of the 8/5/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.