| Publication | Date of Publication | Type |
|---|
| Oracle separation of QMA and QCMA with bounded adaptivity | 2026-01-14 | Paper |
| Randomised composition and small-bias minimax | 2025-08-15 | Paper |
| Unambiguous DNFs and Alon-Saks-Seymour | 2025-08-13 | Paper |
| Classical lower bounds from quantum upper bounds | 2025-08-12 | Paper |
| A tight composition theorem for the randomized query complexity of partial functions (extended abstract) | 2025-08-12 | Paper |
| A new minimax theorem for randomized algorithms (extended abstract) | 2025-08-12 | Paper |
| Symmetries, graph properties, and quantum speedups | 2025-08-12 | Paper |
| Separations in communication complexity using cheat sheets and information complexity | 2025-08-06 | Paper |
A new minimax theorem for randomized algorithms
Journal of the ACM | 2025-02-05 | Paper |
Symmetries, graph properties, and quantum speedups
SIAM Journal on Computing | 2024-12-20 | Paper |
Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7758330 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
On query-to-communication lifting for adversary bounds
(available as arXiv preprint) | 2023-07-12 | Paper |
Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge
(available as arXiv preprint) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7204275 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
scientific article; zbMATH DE number 6913819 (Why is no real title available?)
Theory of Computing | 2018-08-06 | Paper |
Low-sensitivity functions from unambiguous certificates
(available as arXiv preprint) | 2018-05-03 | Paper |
| Randomized query complexity of sabotaged and composed functions | 2017-12-19 | Paper |
scientific article; zbMATH DE number 6789291 (Why is no real title available?)
(available as arXiv preprint) | 2017-10-10 | Paper |
Separations in query complexity using cheat sheets
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
The structure of promises in quantum speedups
(available as arXiv preprint) | 2017-07-19 | Paper |
On Rota's conjecture and nested separations in matroids
Journal of Combinatorial Theory. Series B | 2016-04-21 | Paper |
Data stability in clustering: a closer look
Theoretical Computer Science | 2014-10-31 | Paper |
Learning a classifier when the labeling is known
Lecture Notes in Computer Science | 2011-10-19 | Paper |
