V.I. Levenshtein - Concepedia

Author

V.I. Levenshtein

Keldysh Institute of Applied Mathematics

Also Known As

Levenshtein, Vladimir, Levenshtein, Vladimir I., V Levenshtein, V. I. LEVENSHTEIN, V. I. Levenshtein, V. I. Levenshteĭn, V. Levenshtein, V.I Levenshtein, V.I. Levenshtein, Vladimir I. Levenshtein

Publications

12.3K

Citations

H-Index

Concepts

All Affiliations

Keldysh Institute of Applied Mathematics University of Bergen Russian Academy of Sciences Cornell University

About

V.I. Levenshtein is an author at Keldysh Institute of Applied Mathematics specializing in engineering, computational complexity, and computer science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	18	22	11.8K
2	Computer Science	15	19	11.5K
3	Natural Sciences	2	2	70
4	Communication	1	1	10
5	Computer Engineering	1	1	62

V.I. Levenshtein

Publications

12.2K

Citations

H-Index

Page 1

	Year	Citations
Binary codes capable of correcting deletions, insertions and reversals V.I. Levenshtein Soviet physics. Doklady EngineeringInformation RetrievalString-searching AlgorithmProgram AnalysisKnowledge Discovery	1965	10.4K
Association schemes and coding theory P. Delsarte, V.I. Levenshtein IEEE Transactions on Information Theory Mathematical ProgrammingEngineeringFormal MethodsAlgebraic MethodCombinatorial Design Theory	1998	224
Efficient reconstruction of sequences V.I. Levenshtein IEEE Transactions on Information Theory EngineeringComputational ComplexitySequence DesignDiscrete TimeDistributed Source Coding	2001	195
Efficient Reconstruction of Sequences from Their Subsequences or Supersequences V.I. Levenshtein Journal of Combinatorial Theory Series A Signal ReconstructionComputational ComplexityInverse ProblemsPattern MatchingSequence Design	2001	179
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces V.I. Levenshtein IEEE Transactions on Information Theory Krawtchouk PolynomialsDual Distance DEngineeringUniversal BoundsMinimum Distance	1995	149
Designs as maximum codes in polynomial metric spaces V.I. Levenshtein Acta Applicandae Mathematicae Polynomial Metric SpacesEngineeringCombinatorial DesignCombinatorial Design TheoryComputational Complexity	1992	136
On perfect codes in deletion and insertion metric V.I. Levenshtein Discrete Mathematics and Applications EngineeringFormal MethodsPerfect CodesComputational ComplexityComputer Science	1992	135
Combinatorial problems motivated by comma‐free codes V.I. Levenshtein Journal of Combinatorial Designs Combinatorics On WordEngineeringCombinatory AnalysisComma‐free CodesComputational Complexity	2004	62
Perfect (d,k)-codes capable of correcting single peak-shifts V.I. Levenshtein, A. J. Han Vinck IEEE Transactions on Information Theory Mathematical ProgrammingSystematic CodesEngineeringJoint Source-channel CodingCoding Theory	1993	62
Bounds for deletion/insertion correcting codes V.I. Levenshtein EngineeringAutomated ReasoningProgram AnalysisVerificationFormal Methods	2003	60

Page 1