| Publication | Date of Publication | Type |
|---|
| 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 |
| https://portal.mardi4nfdi.de/entity/Q6062143 | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6176153 | 2023-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874384 | 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 | 2023-02-03 | Paper |
| Approximate Degree in Classical and Quantum Computing | 2023-01-11 | Paper |
| Quantum lower bounds for approximate counting via Laurent polynomials | 2022-07-21 | Paper |
| Sign-rank can increase under intersection | 2022-07-21 | Paper |
| Sign-rank can increase under intersection | 2022-03-29 | Paper |
| The large-error approximate degree of \(\mathrm{AC}^0\) | 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 | 2020-12-17 | Paper |
| On the power of statistical zero knowledge | 2020-08-25 | Paper |
| A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\) | 2020-08-25 | Paper |
| Quantum algorithms and approximating polynomials for composed functions with shared inputs | 2019-10-15 | Paper |
| Hierarchical Heavy Hitters with the Space Saving Algorithm | 2019-09-12 | Paper |
| Verifiable stream computation and Arthur-Merlin communication | 2019-09-02 | Paper |
| The polynomial method strikes back: tight quantum query bounds via dual polynomials | 2019-08-22 | Paper |
| Annotations for Sparse Data Streams | 2019-06-20 | Paper |
| Annotations in data streams | 2018-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601830 | 2018-01-24 | Paper |
| Semi-streaming algorithms for annotated graph streams | 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 | 2017-07-14 | Paper |
| Faster private release of marginals on small databases | 2017-05-19 | Paper |
| Dual polynomials for collision and element distinctness | 2016-11-01 | Paper |
| Practical verified computation with streaming interactive proofs | 2016-10-07 | Paper |
| Streaming Verification in Data Analysis | 2016-01-11 | Paper |
| Hardness amplification and the approximate degree of constant-depth circuits | 2015-10-27 | Paper |
| Dual lower bounds for approximate degree and Markov-Bernstein inequalities | 2015-06-09 | Paper |
| External-memory multimaps | 2013-11-11 | Paper |
| Time-optimal interactive proofs for circuit evaluation | 2013-09-17 | Paper |
| Faster algorithms for privately releasing marginals | 2013-08-12 | Paper |
| Dual lower bounds for approximate degree and Markov-Bernstein inequalities | 2013-08-06 | Paper |
| Cache-oblivious dictionaries and multimaps with negligible failure probability | 2013-04-19 | Paper |
| Streaming graph computations with a helpful advisor | 2013-03-05 | Paper |
| External-memory multimaps | 2011-12-16 | Paper |
| Streaming graph computations with a helpful advisor | 2010-09-06 | Paper |
