V.I. Levenshtein

12.3k total citations · 1 hit paper
48 papers, 7.5k citations indexed

About

V.I. Levenshtein is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Molecular Biology. According to data from OpenAlex, V.I. Levenshtein has authored 48 papers receiving a total of 7.5k indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Artificial Intelligence, 28 papers in Electrical and Electronic Engineering and 15 papers in Molecular Biology. Recurrent topics in V.I. Levenshtein's work include Coding theory and cryptography (27 papers), graph theory and CDMA systems (25 papers) and DNA and Biological Computing (13 papers). V.I. Levenshtein is often cited by papers focused on Coding theory and cryptography (27 papers), graph theory and CDMA systems (25 papers) and DNA and Biological Computing (13 papers). V.I. Levenshtein collaborates with scholars based in Russia, Norway and United States. V.I. Levenshtein's co-authors include P. Delsarte, Torleiv Kløve, Tor Helleseth, A. J. Han Vinck, Vladimir D. Tonchev, Johannes Siemons, Øyvind Ytrehus, Thomas Berger, Sergey G. Molodtsov and Elena V. Konstantinova and has published in prestigious journals such as IEEE Transactions on Information Theory, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

V.I. Levenshtein

46 papers receiving 6.8k citations

Hit Papers

Binary codes capable of correcting deletions, insertions ... 1965 2026 1985 2005 1965 2.0k 4.0k 6.0k
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Binary codes capable of correcting deletions, insertions and reversals
    1965 6.4k citations V.I. Levenshtein Soviet physics. Doklady profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
V.I. Levenshtein Russia 22 4.3k 1.5k 1.4k 996 981 48 7.5k
Pat Langley United States 42 6.2k 1.4× 1.8k 1.2× 992 0.7× 884 0.9× 1.6k 1.6× 207 10.7k
Fernando C. N. Pereira United States 25 9.8k 2.3× 1.5k 1.0× 1.4k 1.0× 663 0.7× 2.5k 2.6× 47 13.1k
Dennis Kibler United States 21 3.8k 0.9× 1.3k 0.9× 612 0.4× 616 0.6× 1.0k 1.0× 55 6.4k
Jude Shavlik United States 38 4.8k 1.1× 1.2k 0.8× 845 0.6× 352 0.4× 666 0.7× 153 6.5k
Hanghang Tong United States 47 5.7k 1.3× 2.1k 1.4× 1.1k 0.8× 1.9k 1.9× 2.6k 2.7× 327 10.5k
Richard A. Harshman Canada 28 6.3k 1.5× 2.6k 1.7× 650 0.4× 750 0.8× 1.8k 1.8× 56 12.7k
Li Zhang China 44 3.3k 0.8× 1.4k 0.9× 939 0.6× 604 0.6× 3.3k 3.4× 485 9.2k
James Bailey Australia 38 3.9k 0.9× 819 0.5× 794 0.5× 552 0.6× 1.6k 1.6× 215 6.8k
Peng Cui China 48 7.1k 1.7× 2.5k 1.6× 1.2k 0.8× 1.2k 1.2× 2.2k 2.2× 219 10.4k
David Lewis Ireland 34 6.2k 1.5× 2.3k 1.5× 487 0.3× 707 0.7× 1.5k 1.5× 243 9.7k

Countries citing papers authored by V.I. Levenshtein

Since Specialization
Citations

This map shows the geographic impact of V.I. Levenshtein's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by V.I. Levenshtein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites V.I. Levenshtein more than expected).

Fields of papers citing papers by V.I. Levenshtein

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by V.I. Levenshtein. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by V.I. Levenshtein. The network helps show where V.I. Levenshtein may publish in the future.

Co-authorship network of co-authors of V.I. Levenshtein

This figure shows the co-authorship network connecting the top 25 collaborators of V.I. Levenshtein. A scholar is included among the top collaborators of V.I. Levenshtein based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with V.I. Levenshtein. V.I. Levenshtein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Levenshtein, V.I. & Johannes Siemons. (2008). Error graphs and the reconstruction of elements in groups. Journal of Combinatorial Theory Series A. 116(4). 795–815. 26 indexed citations
2.
Levenshtein, V.I., et al.. (2007). Reconstruction of a graph from 2-vicinities of its vertices. Discrete Applied Mathematics. 156(9). 1399–1406. 25 indexed citations
3.
Levenshtein, V.I.. (2007). A conjecture on the reconstruction of graphs from metric balls of their vertices. Discrete Mathematics. 308(5-6). 993–998. 5 indexed citations
4.
Levenshtein, V.I.. (2007). Conflict-avoiding codes and cyclic triple systems. Problems of Information Transmission. 43(3). 199–212. 24 indexed citations
5.
Levenshtein, V.I.. (2004). Combinatorial problems motivated by comma‐free codes. Journal of Combinatorial Designs. 12(3). 184–196. 40 indexed citations
6.
Levenshtein, V.I.. (2003). A universal bound for a covering in regular posets and its application to pool testing. Discrete Mathematics. 266(1-3). 293–309. 3 indexed citations
7.
Berger, Toby & V.I. Levenshtein. (2003). Application of cover-free codes and combinatorial designs to two-stage testing. Discrete Applied Mathematics. 128(1). 11–26. 5 indexed citations
8.
Helleseth, Tor, Torleiv Kløve, & V.I. Levenshtein. (2003). . Designs Codes and Cryptography. 28(3). 265–282. 4 indexed citations
9.
Levenshtein, V.I.. (2002). Lower bounds on cross-correlation of codes. 2. 657–661. 3 indexed citations
10.
Levenshtein, V.I.. (2001). Efficient Reconstruction of Sequences from Their Subsequences or Supersequences. Journal of Combinatorial Theory Series A. 93(2). 310–332. 117 indexed citations
11.
Levenshtein, V.I.. (1999). Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications. Discrete Mathematics. 197-198. 515–536. 1 indexed citations
12.
Levenshtein, V.I.. (1998). On designs in compact metric spaces and a universal bound on their size. Discrete Mathematics. 192(1-3). 251–271. 22 indexed citations
13.
Levenshtein, V.I., et al.. (1995). On upper bounds for code distance and covering radius of designs in polynomial metric spaces. Journal of Combinatorial Theory Series A. 70(2). 267–288. 28 indexed citations
14.
Levenshtein, V.I.. (1993). Packing and Decomposition Problems for Polynomial Association Schemes. European Journal of Combinatorics. 14(5). 461–477. 1 indexed citations
15.
Levenshtein, V.I.. (1992). Designs as maximum codes in polynomial metric spaces. Acta Applicandae Mathematicae. 29(1-2). 1–82. 69 indexed citations
16.
Levenshtein, V.I.. (1975). On the minimal redundancy of binary error-correcting codes. Information and Control. 28(4). 268–291. 22 indexed citations
17.
Levenshtein, V.I.. (1965). Binary codes capable of correcting deletions, insertions and reversals. Soviet physics. Doklady. 10(4). 707–710. 6392 indexed citations breakdown →
18.
Levenshtein, V.I.. (1963). The Inversion of Finite Automata. Soviet physics. Doklady. 7. 1081. 2 indexed citations
19.
Levenshtein, V.I.. (1962). Self-Adaptive Automata for Decoding Messages. SPhD. 6. 1042. 7 indexed citations
20.
Levenshtein, V.I.. (1962). Certain Properties of Code Systems. SPhD. 6. 858. 26 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Pat Langley Breakdown of academic impact, for papers by Fernando C. N. Pereira Breakdown of academic impact, for papers by Dennis Kibler Breakdown of academic impact, for papers by Jude Shavlik Breakdown of academic impact, for papers by Hanghang Tong Breakdown of academic impact, for papers by Richard A. Harshman Breakdown of academic impact, for papers by Li Zhang Breakdown of academic impact, for papers by James Bailey Breakdown of academic impact, for papers by Peng Cui Breakdown of academic impact, for papers by David Lewis
Rankless by CCL
2026