Vladimir Levenshtein

Vladimir Levenshtein's AcademicInfluence.com Rankings

Mathematics

#797

World Rank

#1429

Historical Rank

Measure Theory

#559

World Rank

#780

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Vladimir Levenshtein Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Vladimir Iosifovich Levenshtein was a Russian and Soviet scientist who did 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.

(See a Problem?)

Vladimir Levenshtein's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Binary codes capable of correcting deletions, insertions, and reversals (1965) (11681)
Association Schemes and Coding Theory (1998) (237)
Efficient Reconstruction of Sequences from Their Subsequences or Supersequences (2001) (159)
Universal bounds for codes and designs, in Handbookof Coding Theory (1998) (157)
Efficient reconstruction of sequences (2001) (156)
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces (1995) (148)
Designs as maximum codes in polynomial metric spaces (1992) (138)
On perfect codes in deletion and insertion metric (1992) (120)
Perfect (d, k)-codes capable of correcting single peak-shifts (1993) (62)
Combinatorial problems motivated by comma‐free codes (2004) (59)
Bounds on the minimum support weights (1995) (56)
Bounds for deletion/insertion correcting codes (2002) (48)
Optimal conflict-avoiding codes for three active users (2005) (47)
New lower bounds on aperiodic crosscorrelation of binary codes (1998) (43)
On Upper Bounds for Code Distance and Covering Radius of Designs in Polynomial Metric Spaces (1995) (42)
Certain Properties of Code Systems (1962) (36)
Asymptotic efficiency of two-stage disjunctive testing (2001) (34)
Conflict-avoiding codes and cyclic triple systems (2007) (32)
On designs in compact metric spaces and a universal bound on their size (1998) (30)
Error graphs and the reconstruction of elements in groups (2009) (30)
Error-correction capability of binary linear codes (2003) (30)
On the information function of an error-correcting code (1997) (30)
Reconstruction of a graph from 2-vicinities of its vertices (2008) (27)
On the Minimal Redundancy of Binary Error-Correcting Codes (1975) (27)
Reconstruction of permutations distorted by single transposition errors (2007) (19)
Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions (1997) (14)
Bounds for Self-Complementary Codes and Their Applications (1993) (14)
Superimposed codes in the Hamming space (1994) (12)
A bound for codes with given minimum and maximum distances (2006) (10)
Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing (2001) (10)
Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes (2003) (8)
Lower bounds on cross-correlation of codes (1996) (6)
The simplex codes and other even-weight binary linear codes for error correction (2004) (6)
Maximal packing density of n-dimensional Euclidean space with equal balls (1975) (6)
A universal bound for a covering in regular posets and its application to pool testing (2003) (6)
Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications (1999) (6)
A conjecture on the reconstruction of graphs from metric balls of their vertices (2008) (5)
New Problems of Graph Reconstruction (2001) (4)
Error-correction capability of binary linear codes (2003) (3)
Lower Bounds on Crosscorrelation of Codes (1996) (3)
Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynominals (1993) (2)
Reconstruction of a graph from 2-vicinities of its vertices, (2005) (2)
Superimposed Codes in Hamming Space (1993) (2)
Lower bounds on the cross-correlation for codes of a given size (1994) (2)
Packing and Decomposition Problems for Polynomial Association Schemes (1993) (2)
A coset weight count that proves that the simplex codes are not optimal for error correction (2003) (2)
Association schemes and coding theory (invited paper) (2000) (1)
Efficient reconstruction at the output of a discrete memoryless channel (2000) (1)
Other Combinatorial Designs (2006) (1)
06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006) (1)
Applications of coding and design theory to constructing the maximum resilient systems of functions (1995) (0)
A simple proof of the main inequalities for parameters of codes in polynomial association schemes (1994) (0)
Asymptotic Efficiency of Two-Stage (2002) (0)
All Russian mathematical portal (2019) (0)
06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006) (0)
On designs in compact metric spaces bound on their size ’ Vladimir Levenshtein * and a universal (2003) (0)
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 3 On security of statistical databases (2006) (0)
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006 (2006) (0)
Deletion-correcting Codes (2006) (0)
On Minimum Girth of Graphs Reconstructible from Metric Balls of Their Vertices (2006) (0)
On the information function of an error correcting code (1997) (0)
A system of polynomials for the complex hamming spaces (2004) (0)
n ystems of Functions (1978) (0)
Information reconstruction using minimum number of erroneous patterns and optimization problems of multiple transmission (1997) (0)
Asymptotical efficiency of two-stage testing (2002) (0)
Math-Net . Ru All Russian mathematical portal (2019) (0)
On efficiency and properties of countable prefix codes (2001) (0)

This paper list is powered by the following services:

Other Resources About Vladimir Levenshtein

en.wikipedia.org

What Schools Are Affiliated With Vladimir Levenshtein?

Vladimir Levenshtein is affiliated with the following schools:

Moscow State University