Andrew Drucker

56 papers A* 7A 6Misc 1Journal 35Unranked 6

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