T. Erlebach, M. S. de Lima, N. Megow, and J. Schlöter. Sorting and hypergraph orientation under uncertainty with predictions. In *IJCAI*, 2023. URL https://doi.org/10.24963/ijcai.2023/619.
V. Estivill-Castro and D. Wood. A survey of adaptive sorting algorithms. ACM Comput. Surv., 24(4): 441-476, 1992. URL https://doi.org/10.1145/146370.146381.
Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997. URL https://www.sciencedirect.com/science/article/pii/S002200009791504X.
B. Geissmann, S. Leucci, C. Liu, and P. Penna. Optimal sorting with persistent comparison errors. In ESA, 2019. URL https://doi.org/10.4230/LIPiCs.ESA.2019.49.
S. Gollapudi and D. Panigrahi. Online algorithms for rent-or-buy with expert advice. In ICML, 2019. URL http://proceedings.mlr.press/v97/gollapudi19a.html.
Y. Gu and Y. Xu. Optimal bounds for noisy sorting. In STOC, 2023. URL https://doi.org/10.1145/3564246.3585131.
L. J. Guibas, E. M. McCreight, M. F. Plass, and J. R. Roberts. A new representation for linear lists. In STOC, 1977. URL https://doi.org/10.1145/800105.803395.
T. Kraska, A. Beutel, E. H. Chi, J. Dean, and N. Polyzotis. The case for learned index structures. In SIGMOD, 2018. URL https://doi.org/10.1145/3183713.3196909.
T. Kraska, M. Alizadeh, A. Beutel, E. H. Chi, A. Kristo, G. Leclerc, S. Madden, H. Mao, and V. Nathan. SageDB: A learned database system. In CIDR, 2019. URL http://cidrdb.org/cidr2019/papers/p117-kraska-cidr19.pdf.
A. Kristo, K. Vaidya, U. Çetinternetel, S. Misra, and T. Kraska. The case for a learned sorting algorithm. In SIGMOD, 2020. URL https://doi.org/10.1145/3318464.3389752.
S. Lattanzi, T. Lavastida, B. Moseley, and S. Vassilvitskii. Online scheduling via learned weights. In SODA, 2020. URL https://doi.org/10.1137/1.9781611975994.114.
H. Lin, T. Luo, and D. P. Woodruff. Learning augmented binary search trees. In ICML, 2022. URL https://proceedings.mlr.press/v162/lin22f.html.
A. Lindermayr and N. Megow. Permutation predictions for non-clairvoyant scheduling. In SPAA, 2022. URL https://doi.org/10.1145/3490148.3538579.
P. Lu, X. Ren, E. Sun, and Y. Zhang. Generalized sorting with predictions. In SOSA, 2021. URL https://doi.org/10.1137/1.9781611976496.13.
T. Lykouris and S. Vassilvitskii. Competitive caching with machine learned advice. J. ACM, 68(4): 24:1-24:25, 2021. URL https://doi.org/10.1145/3447579.
D. J. Mankowitz, A. Michi, A. Zhernov, M. Gelmi, M. Selvi, C. Paduraru, E. Leurent, S. Iqbal, J.-B. Lespiau, A. Ahern, T. Koppe, K. Millikin, S. Gaffney, S. Elster, J. Broshear, C. Gamble, K. Milan, R. Tung, M. Hwang, T. Cemgil, M. Barekatain, Y. Li, A. Mandhane, T. Hubert, J. Schrittwieser, D. Hassabis, P. Kohli, M. Riedmiller, O. Vinyals, and D. Silver. Faster sorting algorithms discovered using deep reinforcement learning. Nature, 618(7964):257-263, 2023. URL https://doi.org/10.1038/s41586-023-06004-9.
H. Mannila. Measures of presortedness and optimal sorting algorithms. IEEE Trans. Computers, 34 (4):318-325, 1985. URL https://doi.org/10.1109/TC.1985.5009382.
M. Mitzenmacher. Scheduling with predictions and the price of misprediction. In ITCS, 2020. URL https://doi.org/10.4230/LIPiCs.ITCS.2020.14.
M. Mitzenmacher and S. Vassilvitskii. Algorithms with predictions. Commun. ACM, 65(7):33-35, 2022. URL https://doi.org/10.1145/3528087.
J. I. Munro and S. Wild. Nearly-optimal mergesorts: Fast, practical sorting methods that optimally adapt to existing runs. In ESA, 2018. URL https://doi.org/10.4230/LIPiCsESA.2018.63.
T. Peters. [Python-Dev] Sorting. Python Developers Mailinglist, 2002. URL https://mail.python.org/pipermail/python-dev/2002-July/026837.html.
M. Purohit, Z. Svitkina, and R. Kumar. Improving online algorithms via ML predictions. In NeurIPS, 2018. URL https://proceedings.neurips.cc/paper/2018/bit/73a427badebe0e32caa2e1fc7530b7f3-Abstract.html.