| 2023 | COCOON | On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes. | Andrew Drucker, Yuan Li |
| 2021 | QCE | Quantum Fan-out: Circuit Optimizations and Technology Modeling. | Pranav Gokhale, Samantha Koretsky, Shilin Huang, Swarnadeep Majumder, Andrew Drucker, Kenneth R. Brown, Frederic T. Chong |
| 2020 | CRYPTO | Time-Space Tradeoffs and Short Collisions in Merkle-Damgrd Hash Functions. | Akshima, David Cash, Andrew Drucker, Hoeteck Wee |
| 2020 | FOCS | An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature. | Andrew Drucker |
| 2020 | ICALP | The Power of Many Samples in Query Complexity. | Andrew Bassilakis, Andrew Drucker, Mika Gs, Lunjia Hu, Weiyun Ma, Li-Yang Tan |
| 2020 | TCC | A Lower Bound for One-Round Oblivious RAM. | David Cash, Andrew Drucker, Alexander Hoover |
| 2016 | ESA | Exponential Time Paradigms Through the Polynomial Time Lens. | Andrew Drucker, Jesper Nederlof, Rahul Santhanam |
| 2014 | PODC | On the power of the congested clique model. | Andrew Drucker, Fabian Kuhn, Rotem Oshman |
| 2013 | FOCS | Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers. | Andrew Drucker |
| 2012 | FOCS | New Limits to Classical and Quantum Instance Compression. | Andrew Drucker |
| 2012 | PODC | The communication complexity of distributed task allocation. | Andrew Drucker, Fabian Kuhn, Rotem Oshman |
| 2011 | ICALP | Advice Coins for Classical and Quantum Computation. | Scott Aaronson, Andrew Drucker |
| 2011 | ICALP | A PCP Characterization of AM. | Andrew Drucker |
| 2010 | STOC | A full characterization of quantum advice. | Scott Aaronson, Andrew Drucker |