The Power of Unentanglement. - Scott Aaronson; Salman Beigi; Andrew Drucker; Bill Fefferman; Peter W. Shor (Electron. Colloquium Comput. Complex., 2008)

Multitask Efficiencies in the Decision Tree Model. - Andrew Drucker (Electron. Colloquium Comput. Complex., 2008)

Quantum Proofs for Classical Theorems. - Andrew Drucker; Ronald de Wolf (Electron. Colloquium Comput. Complex., 2009)

A PCP Characterization of AM. - Andrew Drucker (Electron. Colloquium Comput. Complex., 2010)

Advice Coins for Classical and Quantum Computation. - Scott Aaronson; Andrew Drucker (Electron. Colloquium Comput. Complex., 2011)

Efficient Probabilistically Checkable Debates. - Andrew Drucker (Electron. Colloquium Comput. Complex., 2011)

Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators. - Andrew Drucker (Electron. Colloquium Comput. Complex., 2011)

Uniform approximation by (quantum) polynomials. - Andrew Drucker; Ronald de Wolf (Quantum Inf. Comput., 2011)

Block sensitivity of minterm-transitive functions. - Andrew Drucker (Theor. Comput. Sci., 2011)

The communication complexity of distributed task allocation. - Andrew Drucker; Fabian Kuhn; Rotem Oshman (PODC, 2012)

Improved direct product theorems for randomized query complexity. - Andrew Drucker (Comput. Complex., 2012)

The complexity of joint computation. - Andrew Drucker (2012)

Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers. - Andrew Drucker (FOCS, 2013)

High-confidence predictions under adversarial uncertainty. - Andrew Drucker (ACM Trans. Comput. Theory, 2013)

On the power of the congested clique model. - Andrew Drucker; Fabian Kuhn; Rotem Oshman (PODC, 2014)

A Full Characterization of Quantum Advice. - Scott Aaronson; Andrew Drucker (SIAM J. Comput., 2014)

New Limits to Classical and Quantum Instance Compression. - Andrew Drucker (SIAM J. Comput., 2015)

Exponential Time Paradigms Through the Polynomial Time Lens. - Andrew Drucker; Jesper Nederlof; Rahul Santhanam (ESA, 2016)

A Note on a Communication Game. - Andrew Drucker (CoRR, 2017)

The Power of Many Samples in Query Complexity. - Andrew Bassilakis; Andrew Drucker; Mika Göös; Lunjia Hu; Weiyun Ma; Li-Yang Tan (Electron. Colloquium Comput. Complex., 2020)

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature. - Andrew Drucker (Electron. Colloquium Comput. Complex., 2020)

Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions. - Akshima; David Cash; Andrew Drucker; Hoeteck Wee (IACR Cryptol. ePrint Arch., 2020)

A Lower Bound for One-Round Oblivious RAM. - David Cash; Andrew Drucker; Alexander Hoover 001 (IACR Cryptol. ePrint Arch., 2020)

Quantum Fan-out: Circuit Optimizations and Technology Modeling. - Pranav Gokhale; Samantha Koretsky; Shilin Huang; Swarnadeep Majumder; Andrew Drucker; Kenneth R. Brown; Frederic T. Chong (QCE, 2021)

Guest Editor's Foreword to the RANDOM 2018 Special Issue. - Andrew Drucker (Adv. Math. Commun., 2022)

On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes. - Andrew Drucker; Yuan Li 047 (COCOON (2), 2023)

On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes. - Andrew Drucker; Yuan Li (CoRR, 2024)