BetterScholar BetterScholar

L. Levin

Symposium on the Theory of Computing, SIAM journal on computing, Proceedings [] 31st Annual Symposium on Foundations of Computer Science, Annual International Cryptology Conference, Information and Control
12
Role
Title
Level Year L/R
🐬 A Pseudorandom Generator from any One-way Function
J. Håstad, R. Impagliazzo, L. Levin, M. Luby 		10 1999
10
🐬
🐢 A hard-core predicate for all one-way functions
Oded Goldreich, L. Levin 		10 1989
10
🐢
🐬 Pseudo-random generation from one-way functions
R. Impagliazzo, L. Levin, M. Luby 		9 1989
9
🐬
🐢 THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
A. Zvonkin, L. Levin 		9 1970
9
🐢
🐬 Checking computations in polylogarithmic time
L. Babai, L. Fortnow, L. Levin, M. Szegedy 		9 1991
9
🐬
🦁 Average Case Complete Problems
L. Levin 		8 1986
8
🦁
🐢 Fair Computation of General Functions in Presence of Immoral Majority
S. Goldwasser, L. Levin 		8 1990
8
🐢
🦁 One-way functions and pseudorandom generators
L. Levin 		8 1985
8
🦁
🦁 Randomness Conservation Inequalities; Information and Independence in Mathematical Theories
L. Levin 		8 1984
8
🦁
🐬 Construction of a pseudo-random generator from any one-way function
Johan Hstad, R. Impagliazzo, L. Levin, M. Luby 		7 1989
7
🐬
🐢 No better ways to generate hard NP instances than picking uniformly at random
R. Impagliazzo, L. Levin 		7 1990
7
🐢
🐬 Security preserving amplification of hardness
Oded Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan, David Zuckerman 		6 1990
6
🐬