| On the (im) possibility of obfuscating programs B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, ... Annual international cryptology conference, 1-18, 2001 | 1990 | 2001 |
| A pseudorandom generator from any one-way function J Håstad, R Impagliazzo, LA Levin, M Luby SIAM Journal on Computing 28 (4), 1364-1396, 1999 | 1917 | 1999 |
| Which problems have strongly exponential complexity? R Impagliazzo, R Paturi, F Zane Journal of Computer and System Sciences 63 (4), 512-530, 2001 | 1776 | 2001 |
| On the complexity of k-SAT R Impagliazzo, R Paturi Journal of Computer and System Sciences 62 (2), 367-375, 2001 | 1726 | 2001 |
| Designated verifier proofs and their applications M Jakobsson, K Sako, R Impagliazzo International Conference on the Theory and Applications of Cryptographic …, 1996 | 1223 | 1996 |
| 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 | 1095 | 1989 |
| Limits on the provable consequences of one-way permutations R Impagliazzo, S Rudich Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989 | 878 | 1989 |
| P = BPP if E requires exponential circuits: derandomizing the XOR lemma R Impagliazzo, A Wigderson Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 874 | 1997 |
| Derandomizing polynomial identity tests means proving circuit lower bounds V Kabanets, R Impagliazzo Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 629 | 2003 |
| On the (im) possibility of obfuscating programs B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, ... Journal of the ACM (JACM) 59 (2), 1-48, 2012 | 565 | 2012 |
| One-way functions are essential for complexity based cryptography R Impagliazzo, M Luby 30th Annual Symposium on Foundations of Computer Science, 230-235, 1989 | 511 | 1989 |
| How to recycle random bits R Impagliazzo, D Zuckerman FOCS 30, 248-253, 1989 | 491 | 1989 |
| A personal view of average-case complexity R Impagliazzo Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference …, 1995 | 459 | 1995 |
| Using the Groebner basis algorithm to find proofs of unsatisfiability M Clegg, J Edmonds, R Impagliazzo Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996 | 454 | 1996 |
| Efficient cryptographic schemes provably as secure as subset sum R Impagliazzo, M Naor Journal of cryptology 9 (4), 199-216, 1996 | 381 | 1996 |
| Hard-core distributions for somewhat hard problems R Impagliazzo Proceedings of IEEE 36th Annual Foundations of Computer Science, 538-545, 1995 | 333 | 1995 |
| In search of an easy witness: Exponential time vs. probabilistic polynomial time R Impagliazzo, V Kabanets, A Wigderson Journal of Computer and System Sciences 65 (4), 672-694, 2002 | 282 | 2002 |
| Pseudorandomness for network algorithms R Impagliazzo, N Nisan, A Wigderson Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994 | 253 | 1994 |
| Extracting randomness using few independent sources B Barak, R Impagliazzo, A Wigderson SIAM Journal on Computing 36 (4), 1095-1118, 2006 | 250 | 2006 |
| Exponential lower bounds for the pigeonhole principle T Pitassi, P Beame, R Impagliazzo Computational complexity 3, 97-140, 1993 | 238 | 1993 |
