Andrew Drucker

PROFILE

Homepage
No homepage is listed.
ORCID
No ORCID is listed.
Affiliations
No affiliations are listed.
Aliases
Andy Drucker
Publication record
40 papers · 808 citations · H-index 12

PAPERS

Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017)
20220 citationsauthor #1
Guest Editor's Foreword to the RANDOM 2018 Special Issue
20220 citationsauthor #1
Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions
202016 citationsauthor #3
The Power of Many Samples in Query Complexity
202010 citationsauthor #2
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
20203 citationsauthor #1
A Lower Bound for One-Round Oblivious RAM
202015 citationsauthor #2
Quantum Fan-out: Circuit Optimizations and Technology Modeling
202024 citationsauthor #5
Derandomization and interlacing polynomials Constructive and nonconstructive methods in combinatorics and TCS Lecturer
20180 citationsauthor #1
A Note on a Communication Game
20172 citationsauthor #1
Exponential Time Paradigms Through the Polynomial Time Lens
20165 citationsauthor #1
On the power of the congested clique model
2014220 citationsauthor #1
Explorer Efficient Probabilistically Checkable Debates
20140 citationsauthor #1
Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers
201321 citationsauthor #1
High-confidence predictions under adversarial uncertainty
20121 citationsauthor #1
The communication complexity of distributed task allocation
201231 citationsauthor #1
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators
20129 citationsauthor #1
The complexity of joint computation
20124 citationsauthor #1
New Limits to Classical and Quantum Instance Compression
2012179 citationsauthor #1
Multiplying 10-digit numbers using Flickr: The power of recognition memory
20112 citationsauthor #1
Advice Coins for Classical and Quantum Computation
201110 citationsauthor #2
High-confidence predictions under adversarial uncertainty
201112 citationsauthor #1
UvA-DARE ( Digital Academic Repository ) Quantum proofs for classical theorems
20110 citationsauthor #1
On Consistently Guessing the Output of Algorithms
20110 citationsauthor #1
Efficient Probabilistically Checkable Debates
20113 citationsauthor #1
A PCP Characterization of AM
201010 citationsauthor #1
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010
201011 citationsauthor #2
Explorer A PCP Characterization of AM
20100 citationsauthor #1
Short Multi-Prover Quantum Proofs for SAT without Entangled Measurements
201035 citationsauthor #2
Improved direct product theorems for randomized query complexity
201033 citationsauthor #1
PCPs for Arthur-Merlin Games and Communication Protocols
20104 citationsauthor #1
Uniform approximation by (quantum) polynomials
20106 citationsauthor #1
Block sensitivity of minterm-transitive functions
201012 citationsauthor #1
A full characterization of quantum advice
201023 citationsauthor #2
Quantum Proofs for Classical Theorems
200956 citationsauthor #1
Explorer The Power of Unentanglement
20090 citationsauthor #1
Explorer The Power of Unentanglement
200951 citationsauthor #1
Short QMA ( k ) Proofs for SAT without Entangling Measurements
20080 citationsauthor #2
Multitask Efficiencies in the Decision Tree Model
20081 citationsauthor #1
Building Assignment Testers–DRAFT
20070 citationsauthor #1
TITLE ? A New Perspective on the Complexity of Counting and Enumeration [ DRAFT ]
year unknown0 citationsauthor #1

TIMELINE

2007 0 citations

2008 1 citations

2009 107 citations

2010 134 citations

2011 27 citations

2012 224 citations

2013 21 citations

2014 220 citations

2016 5 citations

2017 2 citations

2018 0 citations

2020 68 citations

2022 0 citations

Unknown 0 citations

Andrew Drucker

PROFILE

PAPERS

TIMELINE

COAUTHOR MAP

CONCEPT FOOTPRINT