Vladimir Levenshtein

From Wikipedia, the free encyclopedia

Vladimir Iosifovich Levenshtein (Russian: Владимир Иосифович Левенштейн) (born 1935) is a Russian scientist who did research in information theory and error-correcting codes. Among other contributions, he is known for the Levenshtein distance algorithm, which he developed in 1965.

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

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

[edit] External links

• Levenstein's personal webpage - in Russian, including nice picture
• March 2003 pictures of Levenshtein at a professional reception.
• Another (better) picture from the same source
• Web page including picture referring to his 2006 Hamming Medal award

v • d • e Richard W. Hamming Medal Richard Hamming (1988) · Irving S. Reed (1989) · Dennis Ritchie / Thompson (1990) · Elwyn Berlekamp (1991) · Lotfi Asker Zadeh (1992) · Jorma Rissanen (1993) · Gottfried Ungerboeck (1994) · Jacob Ziv (1995) · Mark Semenovich Pinsker (1996) · Thomas M. Cover (1997) · David D. Clark (1998) · David A. Huffman (1999) · Solomon W. Golomb (2000) · Alexander G. Fraser (2001) · Peter Elias (2002) · Claude Berrou / Glavieux (2003) · Jack Keil Wolf (2004) · Neil Sloane (2005) · Vladimir Levenshtein (2006) · Abraham Lempel (2007) · Sergio Verdu (2008)