Andrew Drucker
From MaRDI portal
Person:693001
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| 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 |
| Exponential time paradigms through the polynomial time lens | 2018-03-02 | Paper |
| High-confidence predictions under adversarial uncertainty Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
| New limits to classical and quantum instance compression SIAM Journal on Computing | 2015-11-04 | Paper |
| High-confidence predictions under adversarial uncertainty ACM Transactions on Computation Theory | 2015-09-24 | Paper |
| On the power of the congested clique model Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
| The communication complexity of distributed task allocation Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
| A full characterization of quantum advice SIAM Journal on Computing | 2014-09-18 | Paper |
| A full characterization of quantum advice Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
| Improved direct product theorems for randomized query complexity Computational Complexity | 2012-12-07 | Paper |
| Block sensitivity of minterm-transitive functions Theoretical Computer Science | 2011-10-10 | Paper |
| Uniform approximation by (quantum) polynomials | 2011-10-05 | Paper |
| Efficient Probabilistically Checkable Debates Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
| A PCP characterization of AM Automata, Languages and Programming | 2011-07-06 | Paper |
| Advice coins for classical and quantum computation Automata, Languages and Programming | 2011-07-06 | Paper |
| The power of unentanglement Theory of Computing | 2011-05-24 | Paper |
Research outcomes over time
This page was built for person: Andrew Drucker
