| No. |
Title |
Author |
Year |
| 1 |
Delegation for Search Problems |
Holmgren, Justin et al. |
2022 |
| 2 |
Dynamic Boolean Formula Evaluation |
Das, Rathish et al. |
2021 |
| 3 |
Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs |
Lincoln, Andrea et al. |
2020 |
| 4 |
Faster Random k-CNF Satisfiability |
Lincoln, Andrea et al. |
2020 |
| 5 |
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions |
Lincoln, Andrea et al. |
2020 |
| 6 |
Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy |
Demaine, Erik D. et al. |
2018 |
| 7 |
Conditional Hardness for Sensitivity Problems |
Henzinger, Monika et al. |
2017 |
| 8 |
Deterministic Time-Space Trade-Offs for k-SUM |
Lincoln, Andrea et al. |
2016 |
