Leonid A. Levin

7.0k total citations · 1 hit paper
33 papers, 2.7k citations indexed

About

Leonid A. Levin is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Leonid A. Levin has authored 33 papers receiving a total of 2.7k indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 15 papers in Artificial Intelligence and 5 papers in Molecular Biology. Recurrent topics in Leonid A. Levin's work include Computability, Logic, AI Algorithms (16 papers), semigroups and automata theory (8 papers) and Cryptography and Data Security (8 papers). Leonid A. Levin is often cited by papers focused on Computability, Logic, AI Algorithms (16 papers), semigroups and automata theory (8 papers) and Cryptography and Data Security (8 papers). Leonid A. Levin collaborates with scholars based in United States, Israel and France. Leonid A. Levin's co-authors include Russell Impagliazzo, Michael Luby, Oded Goldreich, Alexander K. Zvonkin, Johan Håstad, László Babai, Lance Fortnow, Márió Szegedy, Ramarathnam Venkatesan and Gene Itkis and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Leonid A. Levin

32 papers receiving 2.4k citations

Hit Papers

align trajectories

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.

A Pseudorandom Generator from any One-way Function

1999 563 citations Russell Impagliazzo, Leonid A. Levin et al. profile →

Peers

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-authorship network of co-authors of Leonid A. Levin

This figure shows the co-authorship network connecting the top 25 collaborators of Leonid A. Levin. A scholar is included among the top collaborators of Leonid A. Levin 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 Leonid A. Levin. Leonid A. Levin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Occam bound on lowest complexity of elements 2016 ·Annals of Pure and Applied Logic ·Leonid A. Levin	0
2	Forbidden information 2013 ·Journal of the ACM ·Leonid A. Levin	4
3	On Constructing 1-1 One-Way Functions 2011 ·Lecture notes in computer science ·Oded Goldreich, Leonid A. Levin, Noam Nisan	1
4	On Sets of High Complexity Strings 2011 ·(unknown), Leonid A. Levin	1
5	Complex tilings 2008 ·Journal of Symbolic Logic ·Bruno Durand, Leonid A. Levin, Alexander Shen	12
6	Local rules and global order, or aperiodic tilings 2005 ·The Mathematical Intelligencer ·Bruno Durand, Leonid A. Levin, Alexander Shen	6
7	Byzantine Agreement Given Partial Broadcast 2005 ·Journal of Cryptology ·Jeffrey Considine, Matthias Fitzi, Matthew Franklin, Leonid A. Levin, Ueli Maurer, David Metcalf	12
8	The Tale of One-Way Functions 2003 ·Problems of Information Transmission ·Leonid A. Levin	26
9	Self-stabilization of circular arrays of automata 2000 ·Theoretical Computer Science ·Leonid A. Levin	1
10	Computational complexity of functions 1996 ·Theoretical Computer Science ·Leonid A. Levin	2
11	Checking computations in polylogarithmic time 1991 ·László Babai, Lance Fortnow, Leonid A. Levin, Márió Szegedy	311
12	Pseudo-random generation from one-way functions 1989 ·Russell Impagliazzo, Leonid A. Levin, Michael Luby	312
13	Power of fast VLSI models is insensitive to wires' thinness 1989 ·Gene Itkis, Leonid A. Levin	1
14	A hard-core predicate for all one-way functions 1989 ·Oded Goldreich, Leonid A. Levin	437
15	Random instances of a graph coloring problem are hard 1988 ·Ramarathnam Venkatesan, Leonid A. Levin	39
16	Randomness conservation inequalities; information and independence in mathematical theories 1984 ·Information and Control ·Leonid A. Levin	118
17	An old linear programming algorithm runs in polynomial time 1982 ·(unknown), Leonid A. Levin	16
18	Causal nets or what is a deterministic computation? 1981 ·Information and Control ·Péter Gács, Leonid A. Levin	6
19	A CONCEPT OF INDEPENDENCE WITH APPLICATIONS IN VARIOUS FIELDS OF MATHEMATICS 1980 ·DSpace@MIT (Massachusetts Institute of Technology) ·Leonid A. Levin	4
20	THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS 1970 ·Russian Mathematical Surveys ·Alexander K. Zvonkin, Leonid A. Levin	342

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