N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: Ranking and clustering. J. ACM, 55(5):23:1-23:27, 2008. URL https://doi.org/10.1145/1411509.1411513.
M. Almanza, F. Chierichetti, S. Lattanzi, A. Panconesi, and G. Re. Online facility location with multiple advice. In NeurIPS, 2021. URL https://proceedings.neurips.cc/paper/2021/ hash/250473494b245120a7eaf8b2e6b1f17c-Abstract.html.
K. Anand, R. Ge, A. Kumar, and D. Panigrahi. Online algorithms with multiple predictions. In ICML, 2022. URL https://proceedings.mlr.press/v162/anand22a.html.
S. Angelopoulos, C. Durr, S. Jin, S. Kamali, and M. P. Renault. Online computation with untrusted advice. In ITCS, 2020. URL https://doi.org/10.4230/LIPics.ITCS.2020.52.
A. Antoniadis, C. Coester, M. Eliás, A. Polak, and B. Simon. Learning-augmented dynamic power management with multiple states via new ski rental bounds. In NeurIPS, 2021. URL https://proceedings.neurips.cc/paper/2021/bit/8b8388180314a337c9aa3c5aa8e2f37a-Abstract.html.
A. Antoniadis, C. Coester, M. Eliás, A. Polak, and B. Simon. Mixing predictions for online metric algorithms. In ICML, 2023. URL https://proceedings.mlr.press/v202/antoniadis23b.html.
Y. Azar, S. Leonardi, and N. Touitou. Flow time scheduling with uncertain processing time. In STOC, 2021. URL https://doi.org/10.1145/3406325.3451023.
Y. Azar, S. Leonardi, and N. Touitou. Distortion-oblivious algorithms for minimizing flow time. In SODA, 2022. URL https://doi.org/10.1137/1.9781611977073.13.
N. Bansal, C. Coester, R. Kumar, M. Purohit, and E. Vee. Learning-augmented weighted paging. In SODA, 2022. URL https://doi.org/10.1137/1.9781611977073.4.
A. Bhaskara, A. Cutkosky, R. Kumar, and M. Purohit. Online linear optimization with many hints. In NeurIPS, 2020. URL https://proceedings.neurips.cc/paper/2020/bit/6c250b592dc94d4de38a79db4d2b18f2-Abstract.html.
M. Braverman and E. Mossel. Noisy sorting without resampling. In SODA, 2008. URL http://dl.acm.org/citation.cfm?id=1347082.1347112.
X. Cao, J. Chen, L. Chen, C. Lambert, R. Peng, and D. Sleator. Learning-augmented b-trees, 2023. URL https://doi.org/10.48550/arXiv.2303.15379.
J. Y. Chen, S. Silwal, A. Vakilian, and F. Zhang. Faster fundamental graph algorithms via learned predictions. In ICML, 2022. URL https://proceedings.mlr.press/v162/chen22v.html.
C. R. Cook and D. J. Kim. Best sorting algorithm for nearly sorted lists. Commun. ACM, 23(11): 620-624, 1980. URL https://doi.org/10.1145/359024.359026.
S. Davies, B. Moseley, S. Vassilvitskii, and Y. Wang. Predictive flows for faster ford-fulkerson. In ICML, 2023. URL https://proceedings.mlr.press/v202/davies23b.html.
M. Dinitz, S. Im, T. Lavastida, B. Moseley, and S. Vassilvitskii. Faster matchings via learned duals. In NeurIPS, 2021. URL https://proceedings.neurips.cc/paper/2021/bit/5616060fb8ae85d93f334e7267307664-Abstract.html.
M. Dinitz, S. Im, T. Lavastida, B. Moseley, and S. Vassilvitskii. Algorithms with prediction portfolios. In NeurIPS, 2022. URL http://papers.nips.cc/paper_files/paper/2022/bit/7f9220f90cc85b0da693643add6618e6-Abscract-Conference.html.
Y. Emek, S. Kutten, and Y. Shi. Online paging with a vanishing regret. In ITCS, 2021. URL https://doi.org/10.4230/LIPIcs.ITCS.2021.67.
J. Ergun, Z. Feng, S. Silwal, D. P. Woodruff, and S. Zhou. Learning-augmented k-means clustering. In ICLR, 2022. URL https://openreview.net/forum?id=X8cLTHexYyY.