| No. |
Title |
Author |
Year |
| 1 |
Ad Hoc Multi-Input Functional Encryption |
Agrawal, Shweta et al. |
2020 |
| 2 |
Improved Approximate Degree Bounds for k-Distinctness |
Mande, Nikhil S. et al. |
2020 |
| 3 |
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials |
Aaronson, Scott et al. |
2020 |
| 4 |
Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches |
Chakrabarti, Amit et al. |
2020 |
| 5 |
Approximate Degree, Secret Sharing, and Concentration Phenomena |
Bogdanov, Andrej et al. |
2019 |
| 6 |
Sign-Rank Can Increase Under Intersection |
Bun, Mark et al. |
2019 |
| 7 |
The Large-Error Approximate Degree of AC^0 |
Bun, Mark et al. |
2019 |
| 8 |
Approximate Degree and the Complexity of Depth Three Circuits |
Bun, Mark et al. |
2018 |
| 9 |
A Framework for Estimating Stream Expression Cardinalities |
Dasgupta, Anirban et al. |
2016 |
| 10 |
Improved Bounds on the Sign-Rank of AC^0 |
Bun, Mark et al. |
2016 |
| 11 |
Lower Bounds for the Approximate Degree of Block-Composed Functions |
Thaler, Justin |
2016 |
| 12 |
Semi-Streaming Algorithms for Annotated Graph Streams |
Thaler, Justin |
2016 |
| 13 |
Verifiable Stream Computation and Arthur–Merlin Communication |
Chakrabarti, Amit et al. |
2015 |
