|
| Scholar | (Selected) Results for author:"Leonid Levin" OR author:"LA Levin". |
A Pseudorandom Generator from any One-way Function -
all 20 versions »
J Hastad, R Impagliazzo, LA Levin,
M Luby - SIAM J. Comput., 1999 - epubs.siam.org
Cited by:
324 +
152 +
58 +
5 +
4 +
1 +
1 +
1 +
1 +
1 +
1 +
1
A hard-core predicate for all one-way functions
O Goldreich, LA Levin - Proceedings of the
twenty-first annual ACM symposium on …, 1989 -
portal.acm.org
Cited by:
348 +
114 +
5 +
2 +
2 +
1 +
1
[CITATION] Universal search
problems
LA Levin
- Problemy Peredachi Informatsii, 1973
Cited by:
142 +
136 +
80 +
11 +
4 +
3 +
2 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1
Pseudo-random generation from one-way functions
R Impagliazzo, LA Levin, M Luby -
Proceedings of the twenty-first annual ACM symposium on …, 1989
- portal.acm.org
Cited by:
278 +
9 +
4 +
2 +
2 +
1 +
1 +
1 +
1 +
1 +
1
The complexity of finite objects and the development of the concepts of
information and randomness …
AK Zvonkin, LA Levin - Russian Math.
Surveys, 1970 - turpion.org
Cited by:
221 +
44 +
11 +
5 +
2 +
2 +
2 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1
Average case complete problems -
all 5 versions »
LA Levin - SIAM Journal on Computing, 1986
- portal.acm.org
Cited by:
249 +
18 +
2 +
1 +
1 +
1
Checking computations in polylogarithmic time -
all 7 versions »
L Babai, L Fortnow, LA Levin, M Szegedy -
Proceedings of the twenty-third annual ACM symposium on …, 1991
- portal.acm.org
Cited by:
266 +
2 +
1
Fair Computation of
General Functions in Presence of Immoral Majority -
all 3 versions »
S Goldwasser, L Levin - CRYPTO, 1990 -
Springer
Cited by:
186 +
19 +
5 +
3 +
1 +
1 +
1 +
1
One-way functions and pseudorandom generators -
all 2 versions »
LA Levin - Proceedings of the seventeenth annual
ACM symposium on …, 1985. Also, Combinatorica, 1987.
Cited by:
177
[CITATION]
Laws of information conservation (non-growth) and aspects
of the foundation of probability theory
LA Levin - Problems Inform. Transmission,
1974
Cited by:
119 +
8 +
1
Randomness conservation inequalities; information and independence
in mathematical theories -
all 2 versions »
LA Levin - Information and Control, 1984.
Earlier versions: A General Concept of Independence of Mathematical
Objects, Math. Dissertation, MIT, 1979;
A Concept of Independence
with Applications in Various Fields of Mathematics,
TR-235/MIT/LCS, 1980.
Cited by:
118 +
2 +
1
[CITATION] On the notion of
a random sequence
LA Levin
- Soviet Math. Dokl, 1973
Cited by:
107 +
20
Security preserving amplification of hardness -
all 4 versions »
… Goldreich, R Impagliazzo, L Levin,
R Venkatesan. … - Foundations of Computer Science, 1990. Proceedings.,
31st …, 1990 - ieeexplore.ieee.org
Cited by:
77 +
3 +
2 +
1
[CITATION]
One-dimensional uniform arrays that wash out finite islands
P Gacs, GL Kurdyumov, LA Levin - Probl.
Peredachi. Inform, 1978
Cited by:
47 +
12 +
2 +
1
[BOOK]
Random instances of a graph coloring problem are hard
R Venkatesan, L Levin - 1988 - ACM Press
New York, NY, USA
Cited by:
57 +
2
[CITATION]
Various measures of complexity for finite objects (axiomatic description)
LA Levin
- Soviet Math. Dokl, 1976
Cited by:
34 +
1
[BOOK]
Randomness and Non-determinism
LA Levin - 1992 - cs.bu.edu
Cited by:
31
The Tale of One-Way Functions -
all 8 versions »
LA Levin - Problems of Information Transmission, 2003
- Springer
Cited by:
24 +
2 +
1
Fast and lean self-stabilizing asynchronous protocols -
all 2 versions »
G Itkis, LA Levin -
Foundations of Computer Science, 1994 Proceedings., 35th …,
1994 - ieeexplore.ieee.org
Cited by:
26
[CITATION] Uniform Tests of Randomness
LA Levin
- Soviet Math. Dokl, 1976
Cited by:
25