[20] Marina Drygala, Sai Ganesh Nagarajan, and Ola Svensson. Online algorithms with costly predictions. In International Conference on Artificial Intelligence and Statistics, pages 8078-8101. PMLR, 2023.
[21] Elbert Du, Franklyn Wang, and Michael Mitzenmacher. Putting the "learning" into learning-augmented algorithms for frequency estimation. In International Conference on Machine Learning, pages 2860-2869. PMLR, 2021.
[22] Paul Dütting, Silvio Lattanzi, Renato Paes Leme, and Sergei Vassilvitskii. Secretaries with advice. In Proceedings of the 22nd ACM Conference on Economics and Computation, EC '21, page 409-429, New York, NY, USA, 2021. Association for Computing Machinery. ISBN 9781450385541. doi: 10.1145/3465456.3467623. URL https://doi.org/10.1145/3465456.3467623.
[23] Paolo Ferragina, Fabrizio Lillo, and Giorgio Vinciguerra. On the performance of learned data structures. Theoretical Computer Science, 871:107-120, 2021.
[24] Rudolf Fleischer. On the bahncard problem. Theoretical Computer Science, 268(1):161-174, 2001.
[25] Martin Gardner. Mathematical games. Scientific american, 222(6):132-140, 1970.
[26] John P. Gilbert and Frederick Mosteller. Recognizing the Maximum of a Sequence, pages 355-398. Springer New York, New York, NY, 2006. ISBN 978-0-387-44956-2. doi: 10.1007/978-0-387-44956-2_22. URL https://doi.org/10.1007/978-0-387-44956-2_22.
[27] Sreenivas Gollapudi and Debmalya Panigrahi. Online algorithms for rent-or-buy with expert advice. In International Conference on Machine Learning, pages 2319-2327. PMLR, 2019.
[28] Anupam Gupta, Debmalya Panigrahi, Bernardo Subcaseaux, and Kevin Sun. Augmenting online algorithms with  $\epsilon$ -accurate predictions. Advances in neural information processing systems, 2022.
[29] Mor Harchol-Balter and Allen B Downey. Exploiting process lifetime distributions for dynamic load balancing. ACM Transactions on Computer Systems (TOCS), 15(3):253-285, 1997.
[30] Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, and Manish Purohit. Online knapsack with frequency predictions. In Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, and Jennifer Wortman Vaughan, editors, Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual, pages 2733-2743, 2021. URL https://proceedings.neurips.cc/paper/2021/bit/161c5c5ad51fcc84157890511b3c8b0-Abstract.html.
[31] Sungjin Im, Ravi Kumar, Aditya Petety, and Manish Purohit. Parsimonious learning-augmented caching. In International Conference on Machine Learning, pages 9588-9601. PMLR, 2022.
[32] Anna R Karlin, Mark S Manasse, Larry Rudolph, and Daniel D Sleator. Competitive snoopy caching. Algorithmica, 3:79-119, 1988.
[33] Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, and Susan Owicki. Competitive randomized algorithms for nonuniform problems. Algorithmica, 11(6):542-571, 1994.
[34] Misha Khodak, Maria-Florina F Balcan, Ameet Talwalkar, and Sergei Vassilvitskii. Learning predictions for algorithms with predictions. Advances in Neural Information Processing Systems, 35:3542–3555, 2022.
[35] Rohan Kodialam. Optimal algorithms for ski rental with soft machine-learned predictions. arXiv preprint arXiv:1903.00092, 2019.
[36] Tim Kraska, Alex Beutel, Ed H Chi, Jeffrey Dean, and Neoklis Polyzotis. The case for learned index structures. In Proceedings of the 2018 international conference on management of data, pages 489-504, 2018.