{"total":28,"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":"2202.04262","title":"Parsimonious Learning-Augmented Caching","created":"2022-02-09","cited_by_count":19,"area":null},{"id":"2210.12438","title":"Algorithms with Prediction Portfolios","created":"2022-10-22","cited_by_count":19,"area":null},{"id":"2205.12850","title":"A Universal Error Measure for Input Predictions Applied to Online Graph Problems","created":"2022-05-25","cited_by_count":14,"area":null},{"id":"2311.00749","title":"Sorting with Predictions","created":"2023-11-01","cited_by_count":14,"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":"2112.05422","title":"Robustification of Online Graph Exploration Methods","created":"2021-12-10","cited_by_count":10,"area":null},{"id":"2202.03519","title":"Smoothed Online Optimization with Unreliable Predictions","created":"2022-02-07","cited_by_count":10,"area":null},{"id":"2408.04122","title":"Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms","created":"2024-08-07","cited_by_count":8,"area":null},{"id":"2301.12863","title":"Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints","created":"2023-01-30","cited_by_count":7,"area":null},{"id":"2405.01013","title":"Non-clairvoyant Scheduling with Partial Predictions","created":"2024-05-02","cited_by_count":7,"area":null},{"id":"2410.15257","title":"Learning-Augmented Algorithms for the Bahncard Problem","created":"2024-10-20","cited_by_count":7,"area":null},{"id":"2205.01247","title":"Scheduling with Speed Predictions","created":"2022-05-02","cited_by_count":6,"area":null},{"id":"2302.00985","title":"Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary","created":"2023-02-02","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":"2503.07545","title":"Queueing, Predictions, and LLMs: Challenges and Open Problems","created":"2025-03-10","cited_by_count":5,"area":null},{"id":"2212.10433","title":"Scheduling with Predictions","created":"2022-12-20","cited_by_count":3,"area":null},{"id":"2402.03564","title":"SkipPredict: When to Invest in Predictions for Scheduling","created":"2024-02-05","cited_by_count":3,"area":null},{"id":"2406.16270","title":"Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams","created":"2024-06-24","cited_by_count":3,"area":null},{"id":"2305.09245","title":"Sorting and Hypergraph Orientation under Uncertainty with Predictions","created":"2023-05-16","cited_by_count":2,"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":"2507.01225","title":"Capacity Planning and Scheduling for Jobs with Uncertainty in Resource Usage and Duration","created":"2025-07-01","cited_by_count":0,"area":null},{"id":"2603.29233","title":"Robust and Consistent Ski Rental with Distributional Advice","created":"2026-03-31","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":"2605.23255","title":"Learning-Augmented Online Scheduling with Parsimonious Preemption","created":"2026-05-22","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":"2610.01343","title":"Robust Non-Clairvoyant Scheduling with Classification Models","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}