Andrew Drucker

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 16

Top Venues

CoRR

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

SIAM J. Comput.

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Andrew Drucker, Yuan Li
On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes. CoRR (2024)
Andrew Drucker, Yuan Li
On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes. COCOON (2) (2023)
Andrew Drucker
Guest Editor's Foreword to the RANDOM 2018 Special Issue. Theory Comput. 18 (2022)
Pranav Gokhale, Samantha Koretsky, Shilin Huang, Swarnadeep Majumder, Andrew Drucker, Kenneth R. Brown, Frederic T. Chong
Quantum Fan-out: Circuit Optimizations and Technology Modeling. QCE (2021)
Andrew Drucker
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature. FOCS (2020)
David Cash, Andrew Drucker, Alexander Hoover
A Lower Bound for One-Round Oblivious RAM. TCC (1) (2020)
Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan
The Power of Many Samples in Query Complexity. Electron. Colloquium Comput. Complex. 27 (2020)
Andrew Drucker
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature. Electron. Colloquium Comput. Complex. 27 (2020)
David Cash, Andrew Drucker, Alexander Hoover
A Lower Bound for One-Round Oblivious RAM. IACR Cryptol. ePrint Arch. 2020 (2020)
Pranav Gokhale, Samantha Koretsky, Shilin Huang, Swarnadeep Majumder, Andrew Drucker, Kenneth R. Brown, Frederic T. Chong
Quantum Fan-out: Circuit Optimizations and Technology Modeling. CoRR (2020)
Akshima, David Cash, Andrew Drucker, Hoeteck Wee
Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions. CRYPTO (1) (2020)
Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan
The Power of Many Samples in Query Complexity. CoRR (2020)
Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan
The Power of Many Samples in Query Complexity. ICALP (2020)
Akshima, David Cash, Andrew Drucker, Hoeteck Wee
Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions. IACR Cryptol. ePrint Arch. 2020 (2020)
Andrew Drucker
A Note on a Communication Game. CoRR (2017)
Andrew Drucker, Jesper Nederlof, Rahul Santhanam
Exponential Time Paradigms Through the Polynomial Time Lens. ESA (2016)
Andrew Drucker
New Limits to Classical and Quantum Instance Compression. SIAM J. Comput. 44 (5) (2015)
Scott Aaronson, Andrew Drucker
A Full Characterization of Quantum Advice. SIAM J. Comput. 43 (3) (2014)
Andrew Drucker, Fabian Kuhn, Rotem Oshman
On the power of the congested clique model. PODC (2014)
Andrew Drucker
Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers. FOCS (2013)
Andrew Drucker
High-confidence predictions under adversarial uncertainty. ACM Trans. Comput. Theory 5 (3) (2013)
Andrew Drucker
New Limits to Classical and Quantum Instance Compression. FOCS (2012)
Andrew Drucker
High-confidence predictions under adversarial uncertainty. ITCS (2012)
Andrew Drucker
Improved direct product theorems for randomized query complexity. Comput. Complex. 21 (2) (2012)
Andrew Drucker
New Limits to Classical and Quantum Instance Compression. Electron. Colloquium Comput. Complex. 19 (2012)
Andrew Drucker, Fabian Kuhn, Rotem Oshman
The communication complexity of distributed task allocation. PODC (2012)
Andrew Drucker
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators. Computational Complexity Conference (2012)
Andrew Drucker
Improved Direct Product Theorems for Randomized Query Complexity. Computational Complexity Conference (2011)
Andrew Drucker, Ronald de Wolf
Quantum Proofs for Classical Theorems. Theory Comput. 2 (2011)
Scott Aaronson, Andrew Drucker
Advice Coins for Classical and Quantum Computation. ICALP (1) (2011)
Andrew Drucker
Block sensitivity of minterm-transitive functions. Theor. Comput. Sci. 412 (41) (2011)
Scott Aaronson, Andrew Drucker
Advice Coins for Classical and Quantum Computation CoRR (2011)
Andrew Drucker
Efficient Probabilistically Checkable Debates. Electron. Colloquium Comput. Complex. 18 (2011)
Andrew Drucker
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators. Electron. Colloquium Comput. Complex. 18 (2011)
Scott Aaronson, Andrew Drucker
Advice Coins for Classical and Quantum Computation. Electron. Colloquium Comput. Complex. 18 (2011)
Andrew Drucker
Efficient Probabilistically Checkable Debates. APPROX-RANDOM (2011)
Andrew Drucker
High-Confidence Predictions under Adversarial Uncertainty CoRR (2011)
Andrew Drucker
A PCP Characterization of AM. ICALP (1) (2011)
Andrew Drucker, Ronald de Wolf
Uniform approximation by (quantum) polynomials. Quantum Inf. Comput. 11 (3&4) (2011)
Andrew Drucker
A PCP Characterization of AM CoRR (2010)
Andrew Drucker
Block Sensitivity of Minterm-Transitive Functions CoRR (2010)
Scott Aaronson, Andrew Drucker
A full characterization of quantum advice. STOC (2010)
Andrew Drucker
Improved Direct Product Theorems for Randomized Query Complexity CoRR (2010)
Andrew Drucker
A PCP Characterization of AM. Electron. Colloquium Comput. Complex. 17 (2010)
Scott Aaronson, Andrew Drucker
A Full Characterization of Quantum Advice. Electron. Colloquium Comput. Complex. 17 (2010)
Scott Aaronson, Andrew Drucker
A Full Characterization of Quantum Advice CoRR (2010)
Andrew Drucker
Improved Direct Product Theorems for Randomized Query Complexity. Electron. Colloquium Comput. Complex. 17 (2010)
Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor
The Power of Unentanglement. Theory Comput. 5 (1) (2009)
Andrew Drucker, Ronald de Wolf
Quantum Proofs for Classical Theorems CoRR (2009)
Andrew Drucker, Ronald de Wolf
Quantum Proofs for Classical Theorems. Electron. Colloquium Comput. Complex. 16 (2009)
Andrew Drucker
Multitask Efficiencies in the Decision Tree Model. Computational Complexity Conference (2009)
Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor
The Power of Unentanglement. Electron. Colloquium Comput. Complex. 15 (051) (2008)
Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor
The Power of Unentanglement. Computational Complexity Conference (2008)
Andrew Drucker
Multitask Efficiencies in the Decision Tree Model CoRR (2008)
Andrew Drucker
Multitask Efficiencies in the Decision Tree Model. Electron. Colloquium Comput. Complex. 15 (096) (2008)

Andrew Drucker.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andrew Drucker