| Publication | Date of Publication | Type |
|---|
| On the power of statistical zero knowledge | 2025-08-06 | Paper |
| A nearly optimal lower bound on the approximate degree of AC\textsuperscript{0} | 2025-08-06 | Paper |
Relative error streaming quantiles
Journal of the ACM | 2025-02-05 | Paper |
| Field-agnostic SNARKs from expand-accumulate codes | 2025-01-10 | Paper |
| \textsf{Jolt}: SNARKs for virtual machines via lookups | 2024-11-13 | Paper |
| Unlocking the lookup singularity with \textsf{Lasso} | 2024-11-13 | Paper |
| \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup | 2024-10-16 | Paper |
| Fiat-Shamir security of FRI and related SNARKs | 2024-06-26 | Paper |
scientific article; zbMATH DE number 7758324 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
scientific article; zbMATH DE number 7716601 (Why is no real title available?)
(available as arXiv preprint) | 2023-07-25 | Paper |
scientific article; zbMATH DE number 7651029 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Ad Hoc Multi-Input Functional Encryption. | 2023-02-03 | Paper |
| The large-error approximate degree of \(\mathrm{AC}^0\) | 2023-02-03 | Paper |
Approximate Degree, Secret Sharing, and Concentration Phenomena
(available as arXiv preprint) | 2023-02-03 | Paper |
Approximate Degree in Classical and Quantum Computing
Foundations and Trends® in Theoretical Computer Science | 2023-01-11 | Paper |
Quantum lower bounds for approximate counting via Laurent polynomials
(available as arXiv preprint) | 2022-07-21 | Paper |
| Sign-rank can increase under intersection | 2022-07-21 | Paper |
Sign-rank can increase under intersection
ACM Transactions on Computation Theory | 2022-03-29 | Paper |
Sign-rank can increase under intersection
ACM Transactions on Computation Theory | 2022-03-29 | Paper |
The large-error approximate degree of \(\mathrm{AC}^0\)
Theory of Computing | 2021-10-25 | Paper |
| Approximate degree and the complexity of depth three circuits | 2021-08-04 | Paper |
The polynomial method strikes back: tight quantum query bounds via dual polynomials
Theory of Computing | 2020-12-17 | Paper |
On the power of statistical zero knowledge
SIAM Journal on Computing | 2020-08-25 | Paper |
A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\)
SIAM Journal on Computing | 2020-08-25 | Paper |
Quantum algorithms and approximating polynomials for composed functions with shared inputs
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Hierarchical Heavy Hitters with the Space Saving Algorithm
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Verifiable stream computation and Arthur-Merlin communication
SIAM Journal on Computing | 2019-09-02 | Paper |
The polynomial method strikes back: tight quantum query bounds via dual polynomials
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Annotations for Sparse Data Streams
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Annotations for Sparse Data Streams
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Annotations in data streams
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| scientific article; zbMATH DE number 6829278 (Why is no real title available?) | 2018-01-24 | Paper |
Semi-streaming algorithms for annotated graph streams
(available as arXiv preprint) | 2017-12-19 | Paper |
| Lower bounds for the approximate degree of block-composed functions | 2017-12-19 | Paper |
| Improved bounds on the sign-rank of \(\mathrm{AC}^0\) | 2017-12-19 | Paper |
A framework for estimating stream expression cardinalities
(available as arXiv preprint) | 2017-07-14 | Paper |
Faster private release of marginals on small databases
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Dual polynomials for collision and element distinctness
Theory of Computing | 2016-11-01 | Paper |
Practical verified computation with streaming interactive proofs
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Streaming Verification in Data Analysis
Algorithms and Computation | 2016-01-11 | Paper |
Hardness amplification and the approximate degree of constant-depth circuits
Automata, Languages, and Programming | 2015-10-27 | Paper |
Dual lower bounds for approximate degree and Markov-Bernstein inequalities
Information and Computation | 2015-06-09 | Paper |
External-memory multimaps
Algorithmica | 2013-11-11 | Paper |
Time-optimal interactive proofs for circuit evaluation
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Faster algorithms for privately releasing marginals
Automata, Languages, and Programming | 2013-08-12 | Paper |
Dual lower bounds for approximate degree and Markov-Bernstein inequalities
Lecture Notes in Computer Science | 2013-08-06 | Paper |
Cache-oblivious dictionaries and multimaps with negligible failure probability
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Streaming graph computations with a helpful advisor
Algorithmica | 2013-03-05 | Paper |
External-memory multimaps
Lecture Notes in Computer Science | 2011-12-16 | Paper |
Streaming graph computations with a helpful advisor
Lecture Notes in Computer Science | 2010-09-06 | Paper |
