default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Drucker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i26]Andrew Drucker, Yuan Li:
On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes. CoRR abs/2402.00378 (2024)- 2023
- [c20]Andrew Drucker, Yuan Li
:
On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes. COCOON (2) 2023: 392-403 - 2022
- [j9]Andrew Drucker:
Guest Editor's Foreword to the RANDOM 2018 Special Issue. Theory Comput. 18: 1-3 (2022) - 2021
- [c19]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: 276-290 - 2020
- [c18]Akshima, David Cash, Andrew Drucker, Hoeteck Wee:
Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions. CRYPTO (1) 2020: 157-186 - [c17]Andrew Drucker:
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature. FOCS 2020: 1081-1090 - [c16]Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan:
The Power of Many Samples in Query Complexity. ICALP 2020: 9:1-9:18 - [c15]David Cash, Andrew Drucker, Alexander Hoover:
A Lower Bound for One-Round Oblivious RAM. TCC (1) 2020: 457-485 - [i25]Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan:
The Power of Many Samples in Query Complexity. CoRR abs/2002.10654 (2020) - [i24]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 abs/2007.04246 (2020) - [i23]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. TR20 (2020) - [i22]Andrew Drucker:
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature. Electron. Colloquium Comput. Complex. TR20 (2020) - [i21]Akshima, David Cash, Andrew Drucker, Hoeteck Wee:
Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions. IACR Cryptol. ePrint Arch. 2020: 770 (2020) - [i20]David Cash, Andrew Drucker, Alexander Hoover:
A Lower Bound for One-Round Oblivious RAM. IACR Cryptol. ePrint Arch. 2020: 1195 (2020)
2010 – 2019
- 2017
- [i19]Andrew Drucker:
A Note on a Communication Game. CoRR abs/1706.07890 (2017) - 2016
- [c14]Andrew Drucker, Jesper Nederlof, Rahul Santhanam:
Exponential Time Paradigms Through the Polynomial Time Lens. ESA 2016: 36:1-36:14 - 2015
- [j8]Andrew Drucker:
New Limits to Classical and Quantum Instance Compression. SIAM J. Comput. 44(5): 1443-1479 (2015) - 2014
- [j7]Scott Aaronson, Andrew Drucker:
A Full Characterization of Quantum Advice. SIAM J. Comput. 43(3): 1131-1183 (2014) - [c13]Andrew Drucker, Fabian Kuhn, Rotem Oshman:
On the power of the congested clique model. PODC 2014: 367-376 - 2013
- [j6]Andrew Drucker:
High-confidence predictions under adversarial uncertainty. ACM Trans. Comput. Theory 5(3): 12:1-12:18 (2013) - [c12]Andrew Drucker:
Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers. FOCS 2013: 736-745 - 2012
- [b1]Andrew Drucker:
The complexity of joint computation. Massachusetts Institute of Technology, Cambridge, MA, USA, 2012 - [j5]Andrew Drucker:
Improved direct product theorems for randomized query complexity. Comput. Complex. 21(2): 197-244 (2012) - [c11]Andrew Drucker:
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators. CCC 2012: 170-180 - [c10]Andrew Drucker:
New Limits to Classical and Quantum Instance Compression. FOCS 2012: 609-618 - [c9]Andrew Drucker:
High-confidence predictions under adversarial uncertainty. ITCS 2012: 1-10 - [c8]Andrew Drucker, Fabian Kuhn, Rotem Oshman:
The communication complexity of distributed task allocation. PODC 2012: 67-76 - [i18]Andrew Drucker:
New Limits to Classical and Quantum Instance Compression. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j4]Andrew Drucker, Ronald de Wolf:
Uniform approximation by (quantum) polynomials. Quantum Inf. Comput. 11(3&4): 215-225 (2011) - [j3]Andrew Drucker:
Block sensitivity of minterm-transitive functions. Theor. Comput. Sci. 412(41): 5796-5801 (2011) - [j2]Andrew Drucker, Ronald de Wolf:
Quantum Proofs for Classical Theorems. Theory Comput. 2: 1-54 (2011) - [c7]Andrew Drucker:
Efficient Probabilistically Checkable Debates. APPROX-RANDOM 2011: 519-529 - [c6]Andrew Drucker:
Improved Direct Product Theorems for Randomized Query Complexity. CCC 2011: 1-11 - [c5]Scott Aaronson, Andrew Drucker:
Advice Coins for Classical and Quantum Computation. ICALP (1) 2011: 61-72 - [c4]Andrew Drucker:
A PCP Characterization of AM. ICALP (1) 2011: 581-592 - [i17]Andrew Drucker:
High-Confidence Predictions under Adversarial Uncertainty. CoRR abs/1101.4446 (2011) - [i16]Scott Aaronson, Andrew Drucker:
Advice Coins for Classical and Quantum Computation. CoRR abs/1101.5355 (2011) - [i15]Scott Aaronson, Andrew Drucker:
Advice Coins for Classical and Quantum Computation. Electron. Colloquium Comput. Complex. TR11 (2011) - [i14]Andrew Drucker:
Efficient Probabilistically Checkable Debates. Electron. Colloquium Comput. Complex. TR11 (2011) - [i13]Andrew Drucker:
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c3]Scott Aaronson, Andrew Drucker:
A full characterization of quantum advice. STOC 2010: 131-140 - [i12]Andrew Drucker:
Block Sensitivity of Minterm-Transitive Functions. CoRR abs/1001.2052 (2010) - [i11]Andrew Drucker:
A PCP Characterization of AM. CoRR abs/1002.3664 (2010) - [i10]Scott Aaronson, Andrew Drucker:
A Full Characterization of Quantum Advice. CoRR abs/1004.0377 (2010) - [i9]Andrew Drucker:
Improved Direct Product Theorems for Randomized Query Complexity. CoRR abs/1005.0644 (2010) - [i8]Scott Aaronson, Andrew Drucker:
A Full Characterization of Quantum Advice. Electron. Colloquium Comput. Complex. TR10 (2010) - [i7]Andrew Drucker:
A PCP Characterization of AM. Electron. Colloquium Comput. Complex. TR10 (2010) - [i6]Andrew Drucker:
Improved Direct Product Theorems for Randomized Query Complexity. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j1]Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor:
The Power of Unentanglement. Theory Comput. 5(1): 1-42 (2009) - [c2]Andrew Drucker:
Multitask Efficiencies in the Decision Tree Model. CCC 2009: 286-297 - [i5]Andrew Drucker, Ronald de Wolf:
Quantum Proofs for Classical Theorems. CoRR abs/0910.3376 (2009) - [i4]Andrew Drucker, Ronald de Wolf:
Quantum Proofs for Classical Theorems. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c1]Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor:
The Power of Unentanglement. CCC 2008: 223-236 - [i3]Andrew Drucker:
Multitask Efficiencies in the Decision Tree Model. CoRR abs/0808.2662 (2008) - [i2]Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor:
The Power of Unentanglement. Electron. Colloquium Comput. Complex. TR08 (2008) - [i1]Andrew Drucker:
Multitask Efficiencies in the Decision Tree Model. Electron. Colloquium Comput. Complex. TR08 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
