| 2026 | STOC | Lower Bounds for Near-Quadratic-Depth Resolution over Parities. | Sreejata Kishor Bhattacharya, Farzan Byramji, Arkadev Chattopadhyay, Russell Impagliazzo |
| 2026 | STOC | High Rate Efficient Local List Decoding from HDX. | Yotam Dikstein, Max Hopkins, Toniann Pitassi, Russell Impagliazzo |
| 2025 | FOCS | Stronger Cell Probe Lower Bounds via Local PRGs. | Oliver Korten, Toniann Pitassi, Russell Impagliazzo |
| 2024 | FOCS | Replicability in High Dimensional Statistics. | Max Hopkins, Russell Impagliazzo, Daniel M. Kane, Sihan Liu, Christopher Ye |
| 2023 | STOC | Stability Is Stable: Connections between Replicability, Privacy, and Adaptive Generalization. | Mark Bun, Marco Gaboardi, Max Hopkins, Russell Impagliazzo, Rex Lei, Toniann Pitassi, Satchit Sivakumar, Jessica Sorrell |
| 2022 | STOC | Reproducibility in learning. | Russell Impagliazzo, Rex Lei, Toniann Pitassi, Jessica Sorrell |
| 2021 | COLT | Boosting in the Presence of Massart Noise. | Ilias Diakonikolas, Russell Impagliazzo, Daniel M. Kane, Rex Lei, Jessica Sorrell, Christos Tzamos |
| 2021 | ICALP | Lifting for Constant-Depth Circuits and Applications to MCSP. | Marco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova |
| 2020 | LICS | The Surprising Power of Constant Depth Algebraic Proofs. | Russell Impagliazzo, Sasank Mouli, Toniann Pitassi |
| 2019 | ICALP | AC | Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal |
| 2018 | ICALP | Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity. | Marco L. Carmosino, Russell Impagliazzo, Manuel Sabin |
| 2018 | ISAAC | Half-Duplex Communication Complexity. | Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, Alexander V. Smal |
| 2017 | MFCS | Does Looking Inside a Circuit Help?. | Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Pierre McKenzie, Shadab Romani |
| 2017 | SODA | Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications. | Jiawei Gao, Russell Impagliazzo, Antonina Kolokolova, R. Ryan Williams |
| 2016 | TCC | Simultaneous Secrecy and Reliability Amplification for a General Channel Model. | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro |
| 2013 | FOCS | A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits. | Russell Impagliazzo, Ramamohan Paturi, Stefan Schneider |
| 2013 | STOC | Strong ETH holds for regular resolution. | Christopher Beck, Russell Impagliazzo |
| 2012 | FOCS | Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-Circuits. | Chris Beck, Russell Impagliazzo, Shachar Lovett |
| 2012 | FOCS | Pseudorandomness from Shrinkage. | Russell Impagliazzo, Raghu Meka, David Zuckerman |
| 2012 | SODA | A satisfiability algorithm for AC | Russell Impagliazzo, William Matthews, Ramamohan Paturi |
| 2012 | STOC | Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space. | Paul Beame, Christopher Beck, Russell Impagliazzo |
| 2009 | STOC | An axiomatic approach to algebrization. | Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova |
| 2009 | STOC | New direct-product testers and 2-query PCPs. | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson |
| 2009 | TCC | Security Amplification for InteractiveCryptographic Primitives. | Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
| 2008 | STOC | Uniform direct product theorems: simplified, optimized, and derandomized. | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson |
| 2007 | CRYPTO | Chernoff-Type Direct Product Theorems. | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
| 2006 | FOCS | Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
| 2006 | STOC | Can every randomized algorithm be derandomized? | Russell Impagliazzo |
| 2004 | FOCS | Extracting Randomness Using Few Independent Sources. | Boaz Barak, Russell Impagliazzo, Avi Wigderson |
| 2004 | SODA | Models of greedy algorithms for graph problems. | Sashka Davis, Russell Impagliazzo |
| 2003 | FOCS | Logics for Reasoning about Cryptographic Constructions. | Russell Impagliazzo, Bruce M. Kapron |
| 2003 | STOC | Derandomizing polynomial identity tests means proving circuit lower bounds. | Valentine Kabanets, Russell Impagliazzo |
| 2002 | FOCS | A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution. | Nathan Segerlind, Samuel R. Buss, Russell Impagliazzo |
| 2002 | ICALP | Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations. | Russell Impagliazzo, Nathan Segerlind |
| 2001 | CRYPTO | On the (Im)possibility of Obfuscating Programs. | Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang |
| 2001 | FOCS | Counting Axioms Do Not Polynomially Simulate Counting Gates. | Russell Impagliazzo, Nathan Segerlind |
| 2001 | SODA | Hill-climbing finds random planted bisections. | Ted Carson, Russell Impagliazzo |
| 2000 | ICALP | Homogenization and the Polynominal Calculus. | Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi |
| 2000 | SODA | A lower bound for DLL algorithms for | Pavel Pudlk, Russell Impagliazzo |
| 2000 | STOC | Extractors and pseudo-random generators with optimal seed length. | Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson |
| 1999 | FOCS | Random CNF's are Hard for the Polynomial Calculus. | Eli Ben-Sasson, Russell Impagliazzo |
| 1999 | FOCS | Near-Optimal Conversion of Hardness into Pseudo-Randomness. | Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson |
| 1999 | STOC | Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes. | Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi |
| 1999 | STOC | Security-Preserving Hardness-Amplification for Any Regular One-Way Function. | Giovanni Di Crescenzo, Russell Impagliazzo |
| 1999 | STACS | How to Forget a Secret. | Giovanni Di Crescenzo, Niels Ferguson, Russell Impagliazzo, Markus Jakobsson |
| 1998 | FOCS | Which Problems Have Strongly Exponential Complexity? | Russell Impagliazzo, Ramamohan Paturi, Francis Zane |
| 1998 | FOCS | Randomness vs. Time: De-Randomization under a Uniform Assumption. | Russell Impagliazzo, Avi Wigderson |
| 1998 | SODA | Go with the Winners for Graph Bisection. | Tassos Dimitriou, Russell Impagliazzo |
| 1997 | FOCS | Does Parallel Repetition Lower the Error in Computationally Sound Protocols? | Mihir Bellare, Russell Impagliazzo, Moni Naor |
| 1997 | STOC | Reducing the Complexity of Reductions. | Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich |
| 1997 | STOC | Untitled record | Russell Impagliazzo, Avi Wigderson |
| 1996 | EuroCrypt | Designated Verifier Proofs and Their Applications. | Markus Jakobsson, Kazue Sako, Russell Impagliazzo |
| 1996 | STOC | Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability. | Matthew Clegg, Jeff Edmonds, Russell Impagliazzo |
| 1996 | STOC | Towards an Analysis of Local Optimization Algorithms. | Tassos Dimitriou, Russell Impagliazzo |
| 1995 | FOCS | Improved Depth Lower Vounds for Small Distance Connectivity. | Paul Beame, Russell Impagliazzo, Toniann Pitassi |
| 1995 | FOCS | Hard-Core Distributions for Somewhat Hard Problems. | Russell Impagliazzo |
| 1995 | STOC | The relative complexity of NP search problems. | Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi |
| 1994 | CIAC | Graph Theory and Interactive Protocols for Reachability Problems on Finite Cellular Automata. | Andrea Clementi, Russell Impagliazzo |
| 1994 | FOCS | Lower Bound on Hilbert's Nullstellensatz and propositional proofs | Paul Beame, Russell Impagliazzo, Jan Krajcek, Toniann Pitassi, Pavel Pudlk |
| 1994 | LICS | Upper and Lower Bounds for Tree-Like Cutting Planes Proofs | Russell Impagliazzo, Toniann Pitassi, Alasdair Urquhart |
| 1994 | STOC | Pseudorandomness for network algorithms. | Russell Impagliazzo, Noam Nisan, Avi Wigderson |
| 1993 | STOC | Size-depth trade-offs for threshold circuits. | Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks |
| 1993 | STACS | Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. | Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski |
| 1992 | STOC | Exponential Lower Bounds for the Pigeonhole Principle | Paul Beame, Russell Impagliazzo, Jan Krajcek, Toniann Pitassi, Pavel Pudlk, Alan R. Woods |
| 1991 | FOCS | Communication Complexity Towards Lower Bounds on Circuit Depth | Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jir Sgall |
| 1991 | FOCS | Computing Planar Intertwines | Arvind Gupta, Russell Impagliazzo |
| 1990 | FOCS | Security Preserving Amplification of Hardness | Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman |
| 1990 | FOCS | No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random | Russell Impagliazzo, Leonid A. Levin |
| 1989 | FOCS | One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract) | Russell Impagliazzo, Michael Luby |
| 1989 | FOCS | Efficient Cryptographic Schemes Provably as Secure as Subset Sum | Russell Impagliazzo, Moni Naor |
| 1989 | FOCS | Decision Versus Search Problems in Super-Polynomial Time | Russell Impagliazzo, Gbor Tardos |
| 1989 | FOCS | How to Recycle Random Bits | Russell Impagliazzo, David Zuckerman |
| 1989 | ICALP | On Dice and Coins: Models of Computation for Random Generation. | David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir |
| 1989 | STOC | Pseudo-random Generation from one-way functions (Extended Abstracts) | Russell Impagliazzo, Leonid A. Levin, Michael Luby |
| 1989 | STOC | Limits on the Provable Consequences of One-Way Permutations | Russell Impagliazzo, Steven Rudich |
| 1988 | CRYPTO | Limits on the Provable Consequences of One-way Permutations. | Russell Impagliazzo, Steven Rudich |
| 1987 | CRYPTO | Direct Minimum-Knowledge Computations. | Russell Impagliazzo, Moti Yung |
| 1987 | FOCS | Generic Oracles and Oracle Classes (Extended Abstract) | Manuel Blum, Russell Impagliazzo |