|
| 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:
583 +
14 +
12 +
6 +
4 +
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:
605 +
13 +
2 +
2
Universal search problems
LA Levin
- Problemy Peredachi Informatsii, 1973
Cited by:
192 +
189 +
99 +
14 +
11 +
4 +
2 +
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:
293 +
56 +
19 +
5 +
2 +
2 +
2 +
2 +
2 +
2 +
2 +
2 +
2
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:
356 +
55 +
4 +
3 +
2 +
1 +
1
Average case complete problems -
all 5 versions
LA Levin - SIAM Journal on Computing, 1986
- portal.acm.org
Cited by:
321 +
21 +
2 +
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:
324 +
2 +
2 +
2
Fair Computation of
General Functions in Presence of Immoral Majority -
all 3 versions
S Goldwasser, L Levin - CRYPTO, 1990 -
Springer
Cited by:
230 +
19 +
2 +
2 +
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:
243
[CITATION] On the notion of
a random sequence
LA Levin
- Soviet Math. Dokl, 1973
Cited by:
158 +
26
Laws of information conservation (nongrowth) and aspects of
the foundation of probability theory
LA Levin - Problems Inform. Transmission,
1974
Cited by:
166 +
9
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:
165 +
2 +
1
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:
96 +
3 +
2 +
2
One-dimensional uniform arrays that wash out finite islands
P Gacs, GL Kurdyumov, LA Levin
- Probl. Peredachi. Inform, 1978
Cited by:
60 +
13 +
2
[BOOK]
Random instances of a graph coloring problem are hard
R Venkatesan, L Levin - 1988 - ACM Press
New York, NY, USA
Cited by:
70 +
2 +
2
[CITATION]
Various measures of complexity for finite objects (axiomatic description)
LA Levin
- Soviet Math. Dokl, 1976
Cited by:
47
[BOOK]
Randomness and Non-determinism
LA Levin - 1992 - cs.bu.edu
Cited by:
40
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:
40
[CITATION] Uniform Tests of Randomness
LA Levin
- Soviet Math. Dokl, 1976
Cited by:
36
The Tale of One-Way Functions -
all 8 versions
LA Levin - Problems of Information Transmission, 2003
- Springer
Cited by:
19 +
9