Andrew Drucker

Available identifiers

Publication	Date of Publication	Type
On the minimum depth of circuits with linear number of wires encoding good codes	2024-08-22	Paper
Time-space tradeoffs and short collisions in Merkle-Damgård hash functions	2022-11-09	Paper
A lower bound for one-round oblivious RAM	2021-12-01	Paper
https://portal.mardi4nfdi.de/entity/Q4606306	2018-03-02	Paper
High-confidence predictions under adversarial uncertainty	2016-10-07	Paper
New Limits to Classical and Quantum Instance Compression	2015-11-04	Paper
High-confidence predictions under adversarial uncertainty	2015-09-24	Paper
On the power of the congested clique model	2015-09-03	Paper
The communication complexity of distributed task allocation	2014-12-05	Paper
A Full Characterization of Quantum Advice	2014-09-18	Paper
A full characterization of quantum advice	2014-08-13	Paper
Improved direct product theorems for randomized query complexity	2012-12-07	Paper
Block sensitivity of minterm-transitive functions	2011-10-10	Paper
Uniform approximation by (quantum) polynomials	2011-10-05	Paper
Efficient Probabilistically Checkable Debates	2011-08-17	Paper
A PCP characterization of AM	2011-07-06	Paper
Advice coins for classical and quantum computation	2011-07-06	Paper
The power of unentanglement	2011-05-24	Paper

This page was built for person: Andrew Drucker