Russell Impagliazzo

Cited by

	All	Since 2016
Citations	18375	6232
h-index	57	36
i10-index	117	75

1400

700

350

1050

1990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202164 76 92 107 121 140 152 197 252 224 276 357 292 412 477 567 703 658 708 722 795 766 815 896 1007 961 1136 1144 1278 1308 1302 63

Co-authors

Steven RudichProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Paul BeameProfessor of Computer Science and Engineering, University of WashingtonVerified email at cs.washington.edu
Michael LubyBitRipple and ICSIVerified email at bitripple.com
Leonid A. LevinVerified email at bu.edu
Amit SahaiSymantec Chair Professor of Computer Science, UCLA; Director of Center for Encrypted FunctionalitiesVerified email at cs.ucla.edu
Antonina KolokolovaComputer Science, Memorial University of NewfoundlandVerified email at cs.toronto.edu
Markus JakobssonFounder/CTO, ZapFraud; Chief of Security and Data Analytics, Amber SolutionsVerified email at zapfraud-inc.com
Jan KrajicekProfessor of Mathematical Logic, Charles University in PragueVerified email at karlin.mff.cuni.cz
David ZuckermanProfessor of Computer Science, University of Texas at AustinVerified email at cs.utexas.edu
Sam BussProfessor of Mathematics and Computer ScienceVerified email at ucsd.edu
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemVerified email at cs.huji.ac.il
Johan HåstadProfessor i teoretisk datalogi, KTHVerified email at kth.se
Jeff EdmondsYork UniversityVerified email at cse.yorku.ca
Stephen CookDepartment of Computer Science, University of TorontoVerified email at cs.toronto.edu
Eli Ben-SassonCo-founder & President, StarkWareVerified email at starkware.co
Ronen ShaltielProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
Jiri SgallComputer Science Institute of Charles UniversityVerified email at iuuk.mff.cuni.cz
Stefan SchneiderUniversity of California San DiegoVerified email at eng.ucsd.edu
Matthew CleggGoogle Inc.Verified email at google.com
Bruce KapronProfessor of Computer Science, University of VictoriaVerified email at uvic.ca

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, ... Annual international cryptology conference, 1-18, 2001	1822*	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	1592*	1999
Which problems have strongly exponential complexity? R Impagliazzo, R Paturi, F Zane Journal of Computer and System Sciences 63 (4), 512-530, 2001	1253	2001
Designated verifier proofs and their applications M Jakobsson, K Sako, R Impagliazzo International Conference on the Theory and Applications of Cryptographic …, 1996	1054	1996
On the complexity of k-SAT R Impagliazzo, R Paturi Journal of Computer and System Sciences 62 (2), 367-375, 2001	1041	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	865	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	676	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	631	1989
Derandomizing polynomial identity tests means proving circuit lower bounds V Kabanets, R Impagliazzo computational complexity 13 (1-2), 1-46, 2004	514	2004
How to recycle random bits R Impagliazzo, D Zuckerman FOCS 89, 248-253, 1989	432	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	395	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	350	1996
Efficient cryptographic schemes provably as secure as subset sum R Impagliazzo, M Naor Journal of cryptology 9 (4), 199-216, 1996	310	1996
Hard-core distributions for somewhat hard problems R Impagliazzo Proceedings of IEEE 36th Annual Foundations of Computer Science, 538-545, 1995	282	1995
A personal view of average-case complexity R Impagliazzo Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference …, 1995	281	1995
Extracting randomness using few independent sources B Barak, R Impagliazzo, A Wigderson SIAM Journal on Computing 36 (4), 1095-1118, 2006	232	2006
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	221	2002
Direct minimum-knowledge computations R Impagliazzo, M Yung Conference on the Theory and Application of Cryptographic Techniques, 40-51, 1987	198	1987
Pseudorandomness for network algorithms R Impagliazzo, N Nisan, A Wigderson Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994	193	1994
The uses of big data in cities LMA Bettencourt Big data 2 (1), 12-22, 2014	192*	2014

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

Upload PDF

Follow this author

Cited by

Co-authors