Folgen
Russell Impagliazzo
Titel
Zitiert von
Zitiert von
Jahr
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
2046*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
1781*1999
Which problems have strongly exponential complexity?
R Impagliazzo, R Paturi, F Zane
Journal of Computer and System Sciences 63 (4), 512-530, 2001
14762001
On the complexity of k-SAT
R Impagliazzo, R Paturi
Journal of Computer and System Sciences 62 (2), 367-375, 2001
13232001
Designated verifier proofs and their applications
M Jakobsson, K Sako, R Impagliazzo
International Conference on the Theory and Applications of Cryptographic …, 1996
11121996
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
9691989
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
7501997
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
7331989
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
5762003
How to recycle random bits
R Impagliazzo, D Zuckerman
FOCS 30, 248-253, 1989
4581989
One-way functions are essential for complexity based cryptography
R Impagliazzo, M Luby
30th Annual Symposium on Foundations of Computer Science, 230-235, 1989
4321989
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
3951996
A personal view of average-case complexity
R Impagliazzo
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference …, 1995
3381995
Efficient cryptographic schemes provably as secure as subset sum
R Impagliazzo, M Naor
Journal of cryptology 9 (4), 199-216, 1996
3291996
Hard-core distributions for somewhat hard problems
R Impagliazzo
Proceedings of IEEE 36th Annual Foundations of Computer Science, 538-545, 1995
3001995
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
2512002
Extracting randomness using few independent sources
B Barak, R Impagliazzo, A Wigderson
SIAM Journal on Computing 36 (4), 1095-1118, 2006
2422006
Pseudorandomness for network algorithms
R Impagliazzo, N Nisan, A Wigderson
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
2211994
Exponential lower bounds for the pigeonhole principle
T Pitassi, P Beame, R Impagliazzo
Computational complexity 3 (2), 97-140, 1993
2171993
Direct minimum-knowledge computations
R Impagliazzo, M Yung
Conference on the Theory and Application of Cryptographic Techniques, 40-51, 1987
2121987
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20