| No. |
Title |
Author |
Year |
| 1 |
Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings |
Xi, Zoe et al. |
2022 |
| 2 |
Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost |
Berger, Aaron et al. |
2022 |
| 3 |
Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game |
Kuszmaul, William et al. |
2022 |
| 4 |
What Does Dynamic Optimality Mean in External Memory? |
Bender, Michael A. et al. |
2022 |
| 5 |
Incremental Edge Orientation in Forests |
Bender, Michael A. et al. |
2021 |
| 6 |
The Variable-Processor Cup Game |
Kuszmaul, William et al. |
2021 |
| 7 |
Train Tracks with Gaps |
Kuszmaul, William |
2020 |
| 8 |
Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation |
Kuszmaul, William |
2019 |
| 9 |
The One-Way Communication Complexity of Dynamic Time Warping Distance |
Braverman, Vladimir et al. |
2019 |
| 10 |
On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings |
Charikar, Moses et al. |
2018 |
