Russell Impagliazzo

Cited by

	All	Since 2018
Citations	21310	6880
h-index	61	37
i10-index	123	81

1400

700

350

1050

199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202354 96 81 114 125 142 171 153 206 227 276 379 316 447 473 629 683 669 724 734 765 718 822 891 987 937 1100 1134 1234 1229 1188 1278 1390 561

Public access

View all

18 articles

1 article

available

not available

Based on funding mandates

Co-authors

Valentine KabanetsProfessor of Computing Science, Simon Fraser UniversityVerified email at sfu.ca
Paul BeameProfessor of Computer Science and Engineering, University of WashingtonVerified email at cs.washington.edu
Steven RudichProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Boaz BarakHarvard UniversityVerified email at boazbarak.org
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLAVerified email at cs.ucla.edu
Michael LubyBitRipple and ICSIVerified email at bitripple.com
Leonid A. LevinVerified email at bu.edu
Antonina KolokolovaComputer Science, Memorial University of NewfoundlandVerified email at cs.toronto.edu
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityVerified email at g.harvard.edu
Moni NaorProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il
Sam BussProfessor of Mathematics and Computer ScienceVerified email at ucsd.edu
Marco Leandro CarmosinoIBM ResearchVerified email at ibm.com
Markus JakobssonFounder/CTO, ZapFraud; Chief Scientist, Artema LABSVerified email at zapfraud-inc.com
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemVerified email at cs.huji.ac.il
David ZuckermanProfessor of Computer Science, University of Texas at AustinVerified email at cs.utexas.edu
Jeff EdmondsYork UniversityVerified email at cse.yorku.ca
Stephen CookDepartment of Computer Science, University of TorontoVerified email at cs.toronto.edu
Kazue SakoWaseda UniversityVerified email at krc.biglobe.ne.jp
Eli Ben-SassonCo-founder & President, StarkWareVerified email at starkware.co

Russell Impagliazzo

UC, San Diego

Verified email at eng.ucsd.edu

Complexity Theory Foundations of Cryptography Randomness in Complexity Proof Complexity Formal analysis of heuristics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
On the (im) possibility of obfuscating programs B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, ... Advances in Cryptology—CRYPTO 2001: 21st Annual International Cryptology …, 2001	2148*	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	1724	1999
Which problems have strongly exponential complexity? R Impagliazzo, R Paturi, F Zane Journal of Computer and System Sciences 63 (4), 512-530, 2001	1540	2001
On the complexity of k-SAT R Impagliazzo, R Paturi Journal of Computer and System Sciences 62 (2), 367-375, 2001	1423	2001
Designated verifier proofs and their applications M Jakobsson, K Sako, R Impagliazzo Advances in Cryptology—EUROCRYPT’96: International Conference on the Theory …, 2001	1156	2001
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	999	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	782	1997
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	769	1989
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	595	2003
How to recycle random bits R Impagliazzo, D Zuckerman FOCS 30, 248-253, 1989	468	1989
One-way functions are essential for complexity based cryptography R Impagliazzo, M Luby 30th Annual Symposium on Foundations of Computer Science, 230-235, 1989	456	1989
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	414	1996
A personal view of average-case complexity R Impagliazzo Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference …, 1995	368	1995
Efficient cryptographic schemes provably as secure as subset sum R Impagliazzo, M Naor Journal of cryptology 9 (4), 199-216, 1996	344	1996
Hard-core distributions for somewhat hard problems R Impagliazzo Proceedings of IEEE 36th Annual Foundations of Computer Science, 538-545, 1995	312	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	255	2002
Extracting randomness using few independent sources B Barak, R Impagliazzo, A Wigderson SIAM Journal on Computing 36 (4), 1095-1118, 2006	245	2006
Pseudorandomness for network algorithms R Impagliazzo, N Nisan, A Wigderson Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994	232	1994
Exponential lower bounds for the pigeonhole principle T Pitassi, P Beame, R Impagliazzo Computational complexity 3, 97-140, 1993	226	1993
Randomness vs time: Derandomization under a uniform assumption R Impagliazzo, A Wigderson Journal of Computer and System Sciences 63 (4), 672-688, 2001	214	2001

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors