| No. |
Title |
Author |
Year |
| 1 |
The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems |
Golovnev, Alexander et al. |
2023 |
| 2 |
On Seedless PRNGs and Premature Next |
Coretti, Sandro et al. |
2022 |
| 3 |
On the Hardness of Average-Case k-SUM |
Brakerski, Zvika et al. |
2021 |
| 4 |
Online Linear Extractors for Independent Sources |
Dodis, Yevgeniy et al. |
2021 |
| 5 |
Extractor Lower Bounds, Revisited |
Aggarwal, Divesh et al. |
2020 |
| 6 |
A Time-Distance Trade-Off for GDD with Preprocessing - Instantiating the DLW Heuristic |
Stephens-Davidowitz, Noah |
2019 |
| 7 |
Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP) |
Aggarwal, Divesh et al. |
2018 |
| 8 |
On the Lattice Distortion Problem |
Bennett, Huck et al. |
2016 |
| 9 |
Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One |
Stephens-Davidowitz, Noah |
2016 |
