| Universal sequential search problems LA Levin Problemy Peredachi Informatsii 9 (3), 115-116, 1973 | 1944* | 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 | 1766 | 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 | 1523 | 1989 |
| 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 | 1030* | 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 | 1008 | 1989 |
| 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 | 794 | 1991 |
| Average case complete problems LA Levin SIAM Journal on Computing 15, 285, 1986 | 674 | 1986 |
| Laws of information conservation (nongrowth) and aspects of the foundation of probability theory LA Levin Problemy Peredachi Informatsii 10 (3), 30-35, 1974 | 544 | 1974 |
| One way functions and pseudorandom generators LA Levin Combinatorica 7 (4), 357-363, 1987 | 474 | 1987 |
| Fair computation of general functions in presence of immoral majority S Goldwasser, L Levin Advances in Cryptology-CRYPT0’90, 77-93, 1991 | 436 | 1991 |
| On the notion of a random sequence LA Levin Soviet Math. Dokl 14 (5), 1413-1416, 1973 | 422* | 1973 |
| Randomness conservation inequalities; information and independence in mathematical theories LA Levin Information and Control 61 (1), 15-37, 1984 | 362 | 1984 |
| One-dimensional uniform arrays that wash out finite islands P Gács, GL Kurdyumov, LA Levin Problemy Peredachi Informatsii 14 (3), 92-96, 1978 | 231* | 1978 |
| 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 | 185 | 1990 |
| 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 | 162 | 1990 |
| The tale of one-way functions LA Levin Problems of Information Transmission 39 (1), 92-103, 2003 | 151* | 2003 |
| Uniform tests of randomness LA Levin Doklady Akademii Nauk 227 (1), 33-35, 1976 | 123 | 1976 |
| Various measures of complexity for finite objects (axiomatic description) LA Levin Soviet Math. Dokl 17 (2), 522-526, 1976 | 106* | 1976 |
| An average case NP-complete graph colouring problem LA Levin, R Venkatesan Combinatorics, Probability and Computing 27 (5), 808-828, 2018 | 104* | 2018 |
| Fast and lean self-stabilizing asynchronous protocols G Itkis, L Levin Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on …, 1994 | 97* | 1994 |
Michael LubyBitRipple and ICSIVerified email at bitripple.com
