The following pages link to Andrew Drucker (Q693001):
Displaying 18 items.
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- Block sensitivity of minterm-transitive functions (Q719324) (← links)
- A lower bound for one-round oblivious RAM (Q2055730) (← links)
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions (Q2096481) (← links)
- A full characterization of quantum advice (Q2875139) (← links)
- The communication complexity of distributed task allocation (Q2933777) (← links)
- On the power of the congested clique model (Q2943637) (← links)
- (Q3002799) (← links)
- Advice Coins for Classical and Quantum Computation (Q3012792) (← links)
- A PCP Characterization of AM (Q3012834) (← links)
- Efficient Probabilistically Checkable Debates (Q3088122) (← links)
- (Q3171708) (← links)
- A Full Characterization of Quantum Advice (Q3190695) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- (Q4606306) (← links)
- High-confidence predictions under adversarial uncertainty (Q5890924) (← links)
- High-confidence predictions under adversarial uncertainty (Q5892193) (← links)
- On the minimum depth of circuits with linear number of wires encoding good codes (Q6591658) (← links)
