[BK18] Karl Bringman and Marvin Kunnemann. Multivariate fine-grained complexity of longest common subsequence. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1216-1235. SIAM, 2018.
[BM16] Karl Bringmann and Wolfgang Mulzer. Approximability of the discrete frechet distance. Journal of Computational Geometry, 7(2):46-76, 2016.
[BPSW21] Jan van den Brand, Binghui Peng, Zhao Song, and Omri Weinstein. Training (overparametrized) neural networks in near-linear time. In 12th Innovations in Theoretical Computer Science Conference (ITCS), 2021.
[Bri14] Karl Bringmann. Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless seth fails. In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pages 661-670. IEEE, 2014.
[BSZ23] Jan van den Brand, Zhao Song, and Tianyi Zhou. Algorithm and hardness for dynamic attention maintenance in large language models. arXiv preprint arXiv:2304.02207, 2023.
[CG19] Yuan Cao and Quanquan Gu. Generalization bounds of stochastic gradient descent for wide and deep neural networks. In NeurIPS, pages 10835-10845, 2019.
$\left[\mathrm{CGH}^{+}19\right]$  Tianle Cai, Ruiqi Gao, Jikai Hou, Siyu Chen, Dong Wang, Di He, Zhihua Zhang, and Liwei Wang. Gram-gauss-newton method: Learning overparameterized neural networks for regression problems. arXiv preprint arXiv:1905.11675, 2019.
[Cha00] Timothy M Chan. Random sampling, halfspace range reporting, and construction of  $(\leq k)$ -levels in three dimensions. SIAM Journal on Computing, 30(2):561-575, 2000.
[Cha02] Moses S Charikar. Similarity estimation techniques from rounding algorithms. In Proceedings of the thirty-fourth annual ACM symposium on Theory of computing (STOC), pages 380-388, 2002.
[Cha12] Timothy M Chan. Optimal partition trees. Discrete & Computational Geometry, 47(4):661-690, 2012.
[Cha19] Timothy M Chan. Orthogonal range searching in moderate dimensions: kd trees and range trees strike back. Discrete & Computational Geometry, 61(4):899-922, 2019.
[Che20] Lijie Chen. On the hardness of approximate and exact (bichromatic) maximum inner product. Theory OF Computing, 16(4):1-50, 2020.
[CIP09] Chris Calabro, Russell Impagliazzo, and Ramamohan Paturi. The complexity of satisfiability of small depth circuits. In International Workshop on Parameterized and Exact Computation, pages 75-85. Springer, 2009.
[CLP+21] Beidi Chen, Zichang Liu, Binghui Peng, Zhaozhuo Xu, Jonathan Lingjie Li, Tri Dao, Zhao Song, Anshumali Shrivastava, and Christopher Re. Mongoose: A learnable lsh framework for efficient neural network training. In ICLR oral, 2021.
[CLS19] Michael B Cohen, Yin Tat Lee, and Zhao Song. Solving linear programs in the current matrix multiplication time. In STOC, 2019.
$\left[\mathrm{CMF}^{+}20\right]$  Beidi Chen, Tharun Medini, James Farwell, Sameh Gobriel, Charlie Tai, and Anshuli Shrivastava. Slide: In defense of smart algorithms over hardware acceleration for large-scale deep learning systems. In In Proceedings of the 3rd Conference on Machine Learning and Systems (MLSys), 2020.
[CT17] Timothy M Chan and Konstantinos Tsakalidis. Dynamic orthogonal range searching on the ram, revisited. Leibniz International Proceedings in Informatics, LIPIcs, 77:281-2813, 2017.