{"total":20,"rows":[{"id":"2202.10199","title":"Permutation Predictions for Non-Clairvoyant Scheduling","created":"2022-02-21","cited_by_count":22,"area":null},{"id":"2311.00749","title":"Sorting with Predictions","created":"2023-11-01","cited_by_count":14,"area":null},{"id":"2304.01781","title":"Mixing predictions for online metric algorithms","created":"2023-04-04","cited_by_count":13,"area":null},{"id":"2404.06280","title":"Algorithms for Caching and MTS with reduced number of predictions","created":"2024-04-09","cited_by_count":12,"area":null},{"id":"2210.02775","title":"Paging with Succinct Predictions","created":"2022-10-06","cited_by_count":10,"area":null},{"id":"2405.01013","title":"Non-clairvoyant Scheduling with Partial Predictions","created":"2024-05-02","cited_by_count":7,"area":null},{"id":"2406.04793","title":"Learning-Augmented Priority Queues","created":"2024-06-07","cited_by_count":7,"area":null},{"id":"2501.12770","title":"On Tradeoffs in Learning-Augmented Algorithms","created":"2025-01-22","cited_by_count":7,"area":null},{"id":"2406.18752","title":"Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems","created":"2024-06-26","cited_by_count":5,"area":null},{"id":"2402.06715","title":"Learning-augmented Online Algorithm for Two-level Ski-rental Problem","created":"2024-02-09","cited_by_count":3,"area":null},{"id":"2507.16242","title":"Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency","created":"2025-07-22","cited_by_count":3,"area":null},{"id":"2506.05479","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","created":"2025-06-05","cited_by_count":2,"area":null},{"id":"2602.21104","title":"Ski Rental with Distributional Predictions of Unknown Quality","created":"2026-02-24","cited_by_count":2,"area":null},{"id":"2606.05380","title":"Learning-Augmented Online Minimization with Dual Predictions","created":"2026-06-03","cited_by_count":1,"area":null},{"id":"2501.17701","title":"Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms","created":"2025-01-29","cited_by_count":0,"area":null},{"id":"2510.14887","title":"Prediction-Specific Design of Learning-Augmented Algorithms","created":"2025-10-16","cited_by_count":0,"area":null},{"id":"2601.06813","title":"Analyzing the effect of prediction accuracy on the distributionally-robust competitive ratio","created":"2026-01-11","cited_by_count":0,"area":null},{"id":"2606.01342","title":"Towards Optimal Robustness in Learning-Augmented Paging","created":"2026-05-31","cited_by_count":0,"area":null},{"id":"2606.18807","title":"Learning Augmented Exact Exponential Algorithms","created":"2026-06-17","cited_by_count":0,"area":null},{"id":"2609.04787","title":"Learning-Augmented Algorithms: Guarantees, Construction Mechanisms, and System-Level Implications","created":"2026-09-04","cited_by_count":0,"area":null}],"next_cursor":null}