☰

Russell Impagliazzo

Affiliations: 
Computer Science and Engineering University of California, San Diego, La Jolla, CA 
Area:
Computer Science, Theory Physics
Google:
"Russell Impagliazzo"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor
Manuel Blum grad student UC Berkeley (Computer Science Tree)

Children

Sign in to add trainee
Ted H. Carson grad student 2001 UCSD
Sara K. More grad student 2003 UCSD
Nathan L. Segerlind grad student 2003 UCSD
Alan Nash grad student 2006 UCSD
Yi-Kai Liu grad student 2007 UCSD
Sashka T. Davis grad student 2008 UCSD
Ragesh Jaiswal grad student 2008 UCSD

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Impagliazzo R, Kabanets V, Volkovich I. (2018) The power of natural properties as oracles Electronic Colloquium On Computational Complexity. 24: 23
Carmosino ML, Impagliazzo R, Lovett S, et al. (2018) Hardness amplification for non-commutative arithmetic circuits Electronic Colloquium On Computational Complexity. 25: 16
Aaronson S, Impagliazzo R, Moshkovitz D. (2014) AM with multiple merlins Proceedings of the Annual Ieee Conference On Computational Complexity. 44-55
Beck C, Impagliazzo R. (2013) Strong ETH holds for regular resolution Proceedings of the Annual Acm Symposium On Theory of Computing. 487-494
Impagliazzo R, Meka R, Zuckerman D. (2012) Pseudorandomness from shrinkage Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 111-119
Beame P, Beck C, Impagliazzo R. (2012) Time-space tradeoffs in resolution: Superpolynomial lower bounds for superlinear space Proceedings of the Annual Acm Symposium On Theory of Computing. 213-231
Impagliazzo R, Kabanets V, Wigderson A. (2012) New direct-product testers and 2-query PCPs Siam Journal On Computing. 41: 1722-1768
Buresh-Oppenheim J, Davis S, Impagliazzo R. (2011) A stronger model of dynamic programming algorithms Algorithmica (New York). 60: 938-968
Alekhnovich M, Borodin A, Buresh-Oppenheim J, et al. (2011) Toward a Model for Backtracking and Dynamic Programming Computational Complexity. 20: 679-740
Beame P, Impagliazzo R, Pitassi T, et al. (2010) Formula caching in DPLL Acm Transactions On Computation Theory. 1
See more...