{"total":38,"rows":[{"id":"2202.10199","title":"Permutation Predictions for Non-Clairvoyant Scheduling","created":"2022-02-21","cited_by_count":22,"area":null},{"id":"2205.03921","title":"Online Algorithms with Multiple Predictions","created":"2022-05-08","cited_by_count":22,"area":null},{"id":"2110.13116","title":"Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds","created":"2021-10-25","cited_by_count":20,"area":null},{"id":"2203.09572","title":"Triangle and Four Cycle Counting with Predictions in Graph Streams","created":"2022-03-17","cited_by_count":20,"area":null},{"id":"2202.04262","title":"Parsimonious Learning-Augmented Caching","created":"2022-02-09","cited_by_count":19,"area":null},{"id":"2112.03082","title":"A Novel Prediction Setup for Online Speed-Scaling","created":"2021-12-06","cited_by_count":17,"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":"2405.09784","title":"Online bipartite matching with imperfect advice","created":"2024-05-16","cited_by_count":13,"area":null},{"id":"2106.14693","title":"Robust Learning-Augmented Caching: An Experimental Study","created":"2021-06-28","cited_by_count":12,"area":null},{"id":"2205.08717","title":"A Regression Approach to Learning-Augmented Online Algorithms","created":"2022-05-18","cited_by_count":12,"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":"2110.11439","title":"(Optimal) Online Bipartite Matching with Degree Information","created":"2021-10-21","cited_by_count":11,"area":null},{"id":"2103.01640","title":"Double Coverage with Machine-Learned Advice","created":"2021-03-02","cited_by_count":10,"area":null},{"id":"2210.02775","title":"Paging with Succinct Predictions","created":"2022-10-06","cited_by_count":10,"area":null},{"id":"2210.17028","title":"Improved Learning-augmented Algorithms for k-means and k-medians Clustering","created":"2022-10-31","cited_by_count":10,"area":null},{"id":"2305.19588","title":"Active causal structure learning with advice","created":"2023-05-31","cited_by_count":10,"area":null},{"id":"2206.00655","title":"Learning-Augmented Algorithms for Online TSP on the Line","created":"2022-06-01","cited_by_count":8,"area":null},{"id":"2403.07413","title":"Learning-Augmented Algorithms with Explicit Predictors","created":"2024-03-12","cited_by_count":8,"area":null},{"id":"2112.05353","title":"Learning-Augmented Algorithms for Online Steiner Tree","created":"2021-12-10","cited_by_count":6,"area":null},{"id":"2107.08277","title":"Improved Bounds for Online Facility Location with Predictions","created":"2021-07-17","cited_by_count":5,"area":null},{"id":"2205.13114","title":"Contextual Pandora's Box","created":"2022-05-26","cited_by_count":5,"area":null},{"id":"2305.18227","title":"Online Dynamic Acknowledgement with Learned Predictions","created":"2023-05-25","cited_by_count":5,"area":null},{"id":"2307.08890","title":"The Predicted-Updates Dynamic Model: Offline, Incremental, and Decremental to Fully Dynamic Transformations","created":"2023-07-17","cited_by_count":4,"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":"2509.20979","title":"Toward Robust and Efficient ML-Based GPU Caching for Modern Inference","created":"2025-09-25","cited_by_count":3,"area":null},{"id":"2312.02547","title":"On Optimal Consistency-Robustness Trade-Off for Learning-Augmented Multi-Option Ski Rental","created":"2023-12-05","cited_by_count":2,"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":"2511.23388","title":"Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model","created":"2025-11-28","cited_by_count":2,"area":null},{"id":"2601.07482","title":"The Secretary Problem with Predictions and a Chosen Order","created":"2026-01-12","cited_by_count":2,"area":null},{"id":"2206.15364","title":"Online TSP with Predictions","created":"2022-06-30","cited_by_count":1,"area":null},{"id":"2606.05380","title":"Learning-Augmented Online Minimization with Dual Predictions","created":"2026-06-03","cited_by_count":1,"area":null},{"id":"2511.16194","title":"A Switching Framework for Online Interval Scheduling with Predictions","created":"2025-11-20","cited_by_count":0,"area":null},{"id":"2602.20706","title":"Online Algorithms with Unreliable Guidance","created":"2026-02-24","cited_by_count":0,"area":null},{"id":"2605.22653","title":"The Secretary Problem with a Stochastic Precursor","created":"2026-05-21","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":"2609.04787","title":"Learning-Augmented Algorithms: Guarantees, Construction Mechanisms, and System-Level Implications","created":"2026-09-04","cited_by_count":0,"area":null},{"id":"2609.33580","title":"Compressing Value Predictions for Learning-Augmented Metrical Task Systems","created":"2026-09-27","cited_by_count":0,"area":null}],"next_cursor":null}