Leonid A. Levin

7.1k citations
33 papers · 2.7k · 1 hit paper · h-index 14

Impact in

    • Complexity and Algorithms in Graphs
    • Computability, Logic, AI Algorithms
    • semigroups and automata theory
    • Cryptography and Data Security
    • Cryptographic Implementations and Security
    • Coding theory and cryptography
    • Machine Learning and Algorithms

Papers in

Leonid A. Levin

32 papers receiving 2.4k citations

Leonid A. Levin's Hit Papers

A Pseudorandom Generator from any One-way Function 1999 · 573 citations
5730+9+18Years since publication100200300400500

Peers

Leonid A. Levin
Comparison fields: 5 of 84
  • Computational Theory and Mathematics 1.7k
  • Artificial Intelligence 2.0k
  • Statistics and Probability 146
  • Computer Vision and Pattern Recognition 359
  • Computer Networks and Communications 345
Replace C. P. Schnorr with:
C. P. Schnorr Germany
Luca Trevisan United States
Nachum Dershowitz Israel
Leonard J. Schulman United States
Rocco A. Servedio United States
Michael Ben-Or Israel
Ronald de Wolf Netherlands
Ronitt Rubinfeld United States
Daniele Micciancio United States
Subhash Khot United States
Leonid A. Levin relative to C. P. Schnorr Germany C. P. Schnorr's profile →
Citations per field
00.5×1.5×
C. P. Schnorr · 1×
Citations per year

Countries citing papers authored by Leonid A. Levin

Since Specialization
Citations

This map shows the geographic impact of Leonid A. Levin'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 Leonid A. Levin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Leonid A. Levin more than expected).

Fields of papers citing papers by Leonid A. Levin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Leonid A. Levin. 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 Leonid A. Levin. The network helps show where Leonid A. Levin may publish in the future.

Co-authors

The 20 scholars most cited alongside Leonid A. Levin, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Leonid A. Levin Line = papers co-authored together Leonid A. Levin links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 33 papers — load more, or switch the sort, to bring in the rest.

#Work
1
A Pseudorandom Generator from any One-way Function
Hit paper breakdown →
1999573
2 1989440
3 1970345
4 1989311
5 1991310
6 1986214
7 1987122
8 1984120
9 198547
10 200240
11 198839
12 200327
13 200219
14 198216
15 200812
16 200512
17 19849
18 19889
19 20018
20 19816

About Leonid A. Levin

Leonid A. Levin is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Molecular Biology, Computer Vision and Pattern Recognition and Computer Networks and Communications, having authored 33 papers that have together received 2.7k indexed citations. Recurring topics across this work include Computability, Logic, AI Algorithms (16 papers), Cryptography and Data Security (8 papers), semigroups and automata theory (8 papers), Cellular Automata and Applications (7 papers), Algorithms and Data Compression (5 papers), Chaos-based Image/Signal Encryption (5 papers), DNA and Biological Computing (5 papers) and Complexity and Algorithms in Graphs (4 papers). The work is most often cited by research in Computational Theory and Mathematics (1.7k citations), Artificial Intelligence (2.0k citations), Statistics and Probability (146 citations), Computer Vision and Pattern Recognition (359 citations) and Computer Networks and Communications (345 citations). Leonid A. Levin has collaborated with scholars based in United States, Israel and France. Frequent co-authors include Russell Impagliazzo, Michael Luby, Oded Goldreich, Alexander K. Zvonkin, Johan Håstad, Márió Szegedy, Lance Fortnow, László Babai, Ramarathnam Venkatesan and Gene Itkis. Their work appears in journals such as Theoretical Computer Science, SIAM Journal on Computing, Journal of the ACM, Annals of Pure and Applied Logic and Journal of Symbolic Logic.

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