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

Andrew Drucker

Andrew Drucker Yuan Li On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes. 2024 abs/2402.00378 CoRR https://doi.org/10.48550/arXiv.2402.00378 db/journals/corr/corr2402.html#abs-2402-00378

Andrew Drucker Yuan Li 0047 On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes. 392-403 2023 COCOON (2) https://doi.org/10.1007/978-3-031-49193-1_30 conf/cocoon/2023-2 db/conf/cocoon/cocoon2023-2.html#DruckerL23

Andrew Drucker Guest Editor's Foreword to the RANDOM 2018 Special Issue. 1-3 2022 18 Theory Comput. https://doi.org/10.4086/toc.2022.v018a001 db/journals/toc/toc18.html#Drucker22

Pranav Gokhale Samantha Koretsky Shilin Huang Swarnadeep Majumder Andrew Drucker Kenneth R. Brown Frederic T. Chong Quantum Fan-out: Circuit Optimizations and Technology Modeling. 276-290 2021 QCE https://doi.org/10.1109/QCE52317.2021.00045 conf/qce/2021 db/conf/qce/qce2021.html#GokhaleKHMDBC21 Akshima David Cash Andrew Drucker Hoeteck Wee Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions. 157-186 2020 CRYPTO (1) https://doi.org/10.1007/978-3-030-56784-2_6 conf/crypto/2020-1 db/conf/crypto/crypto2020-1.html#AkshimaCDW20 Andrew Drucker An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature. 1081-1090 2020 FOCS https://doi.org/10.1109/FOCS46700.2020.00104 conf/focs/2020 db/conf/focs/focs2020.html#Drucker20 Andrew Bassilakis Andrew Drucker Mika Göös Lunjia Hu Weiyun Ma Li-Yang Tan The Power of Many Samples in Query Complexity. 9:1-9:18 2020 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2020.9 conf/icalp/2020 db/conf/icalp/icalp2020.html#BassilakisDGHMT20 David Cash Andrew Drucker Alexander Hoover 0001 A Lower Bound for One-Round Oblivious RAM. 457-485 2020 TCC (1) https://doi.org/10.1007/978-3-030-64375-1_16 conf/tcc/2020-1 db/conf/tcc/tcc2020-1.html#CashDH20

Andrew Bassilakis Andrew Drucker Mika Göös Lunjia Hu Weiyun Ma Li-Yang Tan The Power of Many Samples in Query Complexity. 2020 abs/2002.10654 CoRR https://arxiv.org/abs/2002.10654 db/journals/corr/corr2002.html#abs-2002-10654

Andrew Bassilakis Andrew Drucker Mika Göös Lunjia Hu Weiyun Ma Li-Yang Tan The Power of Many Samples in Query Complexity. TR20-027 2020 TR20 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2020/027 db/journals/eccc/eccc27.html#BassilakisDGHMT20

Andrew Drucker An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature. TR20-145 2020 TR20 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2020/145 db/journals/eccc/eccc27.html#Drucker20

Akshima David Cash Andrew Drucker Hoeteck Wee Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions. 770 2020 2020 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2020/770 db/journals/iacr/iacr2020.html#AkshimaCDW20

David Cash Andrew Drucker Alexander Hoover 0001 A Lower Bound for One-Round Oblivious RAM. 1195 2020 2020 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2020/1195 db/journals/iacr/iacr2020.html#CashDH20

Andrew Drucker A Note on a Communication Game. 2017 abs/1706.07890 CoRR http://arxiv.org/abs/1706.07890 db/journals/corr/corr1706.html#Drucker17

Andrew Drucker Jesper Nederlof Rahul Santhanam Exponential Time Paradigms Through the Polynomial Time Lens. 36:1-36:14 2016 ESA https://doi.org/10.4230/LIPIcs.ESA.2016.36 conf/esa/2016 db/conf/esa/esa2016.html#DruckerNS16

Andrew Drucker New Limits to Classical and Quantum Instance Compression. 1443-1479 2015 44 SIAM J. Comput. 5 https://doi.org/10.1137/130927115 db/journals/siamcomp/siamcomp44.html#Drucker15

Scott Aaronson Andrew Drucker A Full Characterization of Quantum Advice. 1131-1183 2014 43 SIAM J. Comput. 3 https://doi.org/10.1137/110856939 db/journals/siamcomp/siamcomp43.html#AaronsonD14

Andrew Drucker Fabian Kuhn Rotem Oshman On the power of the congested clique model. 367-376 2014 PODC https://doi.org/10.1145/2611462.2611493 conf/podc/2014 db/conf/podc/podc2014.html#DruckerKO13

Andrew Drucker High-confidence predictions under adversarial uncertainty. 12:1-12:18 2013 5 ACM Trans. Comput. Theory 3 https://doi.org/10.1145/2493252.2493257 db/journals/toct/toct5.html#Drucker13

Andrew Drucker Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers. 736-745 2013 FOCS https://doi.org/10.1109/FOCS.2013.84 https://doi.ieeecomputersociety.org/10.1109/FOCS.2013.84 conf/focs/2013 db/conf/focs/focs2013.html#Drucker13 Andrew Drucker The complexity of joint computation. 2012 Massachusetts Institute of Technology, Cambridge, MA, USA https://hdl.handle.net/1721.1/78445 ndltd.org (oai:dspace.mit.edu:1721.1/78445)

Andrew Drucker Improved direct product theorems for randomized query complexity. 197-244 2012 21 Comput. Complex. 2 https://doi.org/10.1007/s00037-012-0043-7 db/journals/cc/cc21.html#Drucker12

Andrew Drucker Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators. 170-180 2012 CCC https://doi.org/10.1109/CCC.2012.39 https://doi.ieeecomputersociety.org/10.1109/CCC.2012.39 conf/coco/2012 db/conf/coco/coco2012.html#Drucker12 Andrew Drucker New Limits to Classical and Quantum Instance Compression. 609-618 2012 FOCS https://doi.org/10.1109/FOCS.2012.71 https://doi.ieeecomputersociety.org/10.1109/FOCS.2012.71 conf/focs/2012 db/conf/focs/focs2012.html#Drucker12 Andrew Drucker High-confidence predictions under adversarial uncertainty. 1-10 2012 ITCS https://doi.org/10.1145/2090236.2090237 conf/innovations/2012 db/conf/innovations/innovations2012.html#Drucker12 Andrew Drucker Fabian Kuhn Rotem Oshman The communication complexity of distributed task allocation. 67-76 2012 PODC https://doi.org/10.1145/2332432.2332443 conf/podc/2012 db/conf/podc/podc2012.html#DruckerKO12

Andrew Drucker New Limits to Classical and Quantum Instance Compression. TR12-112 2012 TR12 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2012/112 db/journals/eccc/eccc19.html#Drucker12

Andrew Drucker Ronald de Wolf Uniform approximation by (quantum) polynomials. 215-225 2011 11 Quantum Inf. Comput. 3&4 https://doi.org/10.26421/QIC11.3-4-2 db/journals/qic/qic11.html#DruckerW11

Andrew Drucker Block sensitivity of minterm-transitive functions. 5796-5801 2011 412 Theor. Comput. Sci. 41 https://doi.org/10.1016/j.tcs.2011.06.025 db/journals/tcs/tcs412.html#Drucker11

Andrew Drucker Ronald de Wolf Quantum Proofs for Classical Theorems. 1-54 2011 2 Theory Comput. https://doi.org/10.4086/toc.gs.2011.002 db/journals/toc/gs2.html#DruckerW11

Andrew Drucker Efficient Probabilistically Checkable Debates. 519-529 2011 APPROX-RANDOM https://doi.org/10.1007/978-3-642-22935-0_44 conf/approx/2011 db/conf/approx/approx2011.html#Drucker11 Andrew Drucker Improved Direct Product Theorems for Randomized Query Complexity. 1-11 2011 CCC https://doi.org/10.1109/CCC.2011.29 https://doi.ieeecomputersociety.org/10.1109/CCC.2011.29 conf/coco/2011 db/conf/coco/coco2011.html#Drucker11 Scott Aaronson Andrew Drucker Advice Coins for Classical and Quantum Computation. 61-72 2011 ICALP (1) https://doi.org/10.1007/978-3-642-22006-7_6 conf/icalp/2011-1 db/conf/icalp/icalp2011-1.html#AaronsonD11 Andrew Drucker A PCP Characterization of AM. 581-592 2011 ICALP (1) https://doi.org/10.1007/978-3-642-22006-7_49 conf/icalp/2011-1 db/conf/icalp/icalp2011-1.html#Drucker11

Andrew Drucker High-Confidence Predictions under Adversarial Uncertainty http://arxiv.org/abs/1101.4446 2011 CoRR abs/1101.4446 db/journals/corr/corr1101.html#abs-1101-4446

Scott Aaronson Andrew Drucker Advice Coins for Classical and Quantum Computation http://arxiv.org/abs/1101.5355 2011 CoRR abs/1101.5355 db/journals/corr/corr1101.html#abs-1101-5355

Scott Aaronson Andrew Drucker Advice Coins for Classical and Quantum Computation. TR11-008 2011 TR11 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2011/008 db/journals/eccc/eccc18.html#AaronsonD11

Andrew Drucker Efficient Probabilistically Checkable Debates. TR11-073 2011 TR11 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2011/073 db/journals/eccc/eccc18.html#Drucker11

Andrew Drucker Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators. TR11-125 2011 TR11 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2011/125 db/journals/eccc/eccc18.html#Drucker11a

Scott Aaronson Andrew Drucker A full characterization of quantum advice. 131-140 2010 STOC https://doi.org/10.1145/1806689.1806710 https://www.wikidata.org/entity/Q130925558 conf/stoc/2010 db/conf/stoc/stoc2010.html#AaronsonD10

Andrew Drucker Block Sensitivity of Minterm-Transitive Functions http://arxiv.org/abs/1001.2052 2010 CoRR abs/1001.2052 db/journals/corr/corr1001.html#abs-1001-2052

Andrew Drucker A PCP Characterization of AM http://arxiv.org/abs/1002.3664 2010 CoRR abs/1002.3664 db/journals/corr/corr1002.html#abs-1002-3664

Scott Aaronson Andrew Drucker A Full Characterization of Quantum Advice http://arxiv.org/abs/1004.0377 2010 CoRR abs/1004.0377 db/journals/corr/corr1004.html#abs-1004-0377

Andrew Drucker Improved Direct Product Theorems for Randomized Query Complexity http://arxiv.org/abs/1005.0644 2010 CoRR abs/1005.0644 db/journals/corr/corr1005.html#abs-1005-0644

Scott Aaronson Andrew Drucker A Full Characterization of Quantum Advice. TR10-057 2010 TR10 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2010/057 db/journals/eccc/eccc17.html#AaronsonD10

Andrew Drucker A PCP Characterization of AM. TR10-019 2010 TR10 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2010/019 db/journals/eccc/eccc17.html#Drucker10

Andrew Drucker Improved Direct Product Theorems for Randomized Query Complexity. TR10-080 2010 TR10 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2010/080 db/journals/eccc/eccc17.html#Drucker10a

Scott Aaronson Salman Beigi Andrew Drucker Bill Fefferman Peter W. Shor The Power of Unentanglement. 1-42 2009 5 Theory Comput. 1 https://doi.org/10.4086/toc.2009.v005a001 db/journals/toc/toc5.html#AaronsonBDFS09

Andrew Drucker Multitask Efficiencies in the Decision Tree Model. 286-297 2009 CCC https://doi.org/10.1109/CCC.2009.33 https://doi.ieeecomputersociety.org/10.1109/CCC.2009.33 conf/coco/2009 db/conf/coco/coco2009.html#Drucker09

Andrew Drucker Ronald de Wolf Quantum Proofs for Classical Theorems http://arxiv.org/abs/0910.3376 2009 CoRR abs/0910.3376 db/journals/corr/corr0910.html#abs-0910-3376

Andrew Drucker Ronald de Wolf Quantum Proofs for Classical Theorems. TR09-102 2009 TR09 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2009/102 db/journals/eccc/eccc16.html#DruckerW09

Scott Aaronson Salman Beigi Andrew Drucker Bill Fefferman Peter W. Shor The Power of Unentanglement. 223-236 2008 CCC https://doi.org/10.1109/CCC.2008.5 https://doi.ieeecomputersociety.org/10.1109/CCC.2008.5 conf/coco/2008 db/conf/coco/coco2008.html#AaronsonBDFS08

Andrew Drucker Multitask Efficiencies in the Decision Tree Model http://arxiv.org/abs/0808.2662 2008 CoRR abs/0808.2662 db/journals/corr/corr0808.html#abs-0808-2662

Scott Aaronson Salman Beigi Andrew Drucker Bill Fefferman Peter W. Shor The Power of Unentanglement. 2008 TR08 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-051/index.html TR08-051 db/journals/eccc/eccc15.html#AaronsonBDFS08

Andrew Drucker Multitask Efficiencies in the Decision Tree Model. 2008 TR08 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-096/index.html TR08-096 db/journals/eccc/eccc15.html#Drucker08

Scott Aaronson Akshima Andrew Bassilakis Salman Beigi Kenneth R. Brown David Cash Frederic T. Chong Bill Fefferman Pranav Gokhale Mika Göös Alexander Hoover 0001 Lunjia Hu Shilin Huang Samantha Koretsky Fabian Kuhn Yuan Li Yuan Li 0047 Weiyun Ma Swarnadeep Majumder Jesper Nederlof Rotem Oshman Rahul Santhanam Peter W. Shor Li-Yang Tan Hoeteck Wee Ronald de Wolf