Andrew Drucker

According to our database1, Andrew Drucker authored at least 27 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes.
CoRR, 2024

2023
On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022
Guest Editor's Foreword to the RANDOM 2018 Special Issue.
Theory Comput., 2022

2021
Quantum Fan-out: Circuit Optimizations and Technology Modeling.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2021

2020
A Lower Bound for One-Round Oblivious RAM.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

The Power of Many Samples in Query Complexity.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2017
A Note on a Communication Game.
CoRR, 2017

2016
Exponential Time Paradigms Through the Polynomial Time Lens.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2014
On the power of the congested clique model.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013
Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
The complexity of joint computation.
PhD thesis, 2012

The communication complexity of distributed task allocation.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

High-confidence predictions under adversarial uncertainty.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

New Limits to Classical and Quantum Instance Compression.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators.
Proceedings of the 27th Conference on Computational Complexity, 2012

2011
Block sensitivity of minterm-transitive functions.
Theor. Comput. Sci., 2011

Uniform approximation by (quantum) polynomials.
Quantum Inf. Comput., 2011

A PCP Characterization of AM.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Advice Coins for Classical and Quantum Computation.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Improved Direct Product Theorems for Randomized Query Complexity.
Proceedings of the 26th Annual IEEE Conference on Computational Complexity, 2011

Efficient Probabilistically Checkable Debates.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
A full characterization of quantum advice.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2009
Quantum Proofs for Classical Theorems.
Electron. Colloquium Comput. Complex., 2009

Multitask Efficiencies in the Decision Tree Model.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2008
The Power of Unentanglement.
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008


  Loading...