Leonid A. Levin
Leonid A. Levin
Affiliazione sconosciuta
Email verificata su bu.edu - Home page
TitoloCitata daAnno
Universal sequential search problems
LA Levin
Problemy Peredachi Informatsii 9 (3), 115-116, 1973
1551*1973
A pseudorandom generator from any one-way function
J Håstad, R Impagliazzo, LA Levin, M Luby
SIAM J. Comput. 28 (4), 1364-1396, 1999
1515*1999
A hard-core predicate for all one-way functions
O Goldreich, LA Levin
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
12841989
The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms
AK Zvonkin, LA Levin
Russian Mathematical Surveys 25, 83, 1970
919*1970
Pseudo-random generation from one-way functions
R Impagliazzo, LA Levin, M Luby
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
8451989
Checking computations in polylogarithmic time
L Babai, L Fortnow, LA Levin, M Szegedy
Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991
6721991
Average case complete problems
LA Levin
SIAM Journal on Computing 15, 285, 1986
5571986
Laws of information conservation (nongrowth) and aspects of the foundation of probability theory
LA Levin
Problemy Peredachi Informatsii 10 (3), 30-35, 1974
4621974
One way functions and pseudorandom generators
LA Levin
Combinatorica 7 (4), 357-363, 1987
4081987
Fair computation of general functions in presence of immoral majority
S Goldwasser, L Levin
Advances in Cryptology-CRYPT0’90, 77-93, 1991
3981991
On the notion of a random sequence
LA Levin
Soviet Math. Dokl 14 (5), 1413-1416, 1973
375*1973
Randomness conservation inequalities; information and independence in mathematical theories
LA Levin
Information and Control 61 (1), 15-37, 1984
2961984
One-dimensional uniform arrays that wash out finite islands
P Gács, GL Kurdyumov, LA Levin
Problemy Peredachi Informatsii 14 (3), 92-96, 1978
202*1978
Dispersion, feeding behavior and competition in two spionid polychaetes
LA Levin, L LA
1581981
Security preserving amplification of hardness
O Goldreich, R Impagliazzo, L Levin, R Venkatesan, D Zuckerman
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium …, 1990
1471990
No better ways to generate hard NP instances than picking uniformly at random
R Impagliazzo, LA Levin
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium …, 1990
1421990
The tale of one-way functions
LA Levin
Problems of Information Transmission 39 (1), 92-103, 2003
112*2003
Uniform tests of randomness
LA Levin
Soviet Mathematics Doklady 17 (2), 337-339, 1976
99*1976
Various measures of complexity for finite objects (axiomatic description)
LA Levin
Soviet Math. Dokl 17 (2), 522-526, 1976
95*1976
An average case NP-complete graph colouring problem
LA Levin, R Venkatesan
Combinatorics, Probability and Computing 27 (5), 808-828, 2018
93*2018
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20