{"total":20,"rows":[{"id":"2311.00749","title":"Sorting with Predictions","created":"2023-11-01","cited_by_count":14,"area":null},{"id":"2411.16030","title":"Binary Search with Distributional Predictions","created":"2024-11-25","cited_by_count":11,"area":null},{"id":"2305.10536","title":"Online List Labeling with Predictions","created":"2023-05-17","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":"2402.10457","title":"Learning-Augmented Search Data Structures","created":"2024-02-16","cited_by_count":4,"area":null},{"id":"2405.03661","title":"Competitive strategies to use \"warm start\" algorithms with predictions","created":"2024-05-06","cited_by_count":4,"area":null},{"id":"2306.05865","title":"Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case","created":"2023-06-09","cited_by_count":3,"area":null},{"id":"2502.08125","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","created":"2025-02-12","cited_by_count":3,"area":null},{"id":"2405.18568","title":"Warm-starting Push-Relabel","created":"2024-05-28","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":"2412.03332","title":"On Approximability of $\\ell_2^2$ Min-Sum Clustering","created":"2024-12-04","cited_by_count":1,"area":null},{"id":"2510.10705","title":"Learning-Augmented Streaming Algorithms for Correlation Clustering","created":"2025-10-12","cited_by_count":1,"area":null},{"id":"2505.03955","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","created":"2025-05-06","cited_by_count":0,"area":null},{"id":"2510.03917","title":"Transductive and Learning-Augmented Online Regression","created":"2025-10-04","cited_by_count":0,"area":null},{"id":"2511.19573","title":"Neural Tractability via Structure: Learning-Augmented Algorithms for Graph Combinatorial Optimization","created":"2025-11-24","cited_by_count":0,"area":null},{"id":"2601.20203","title":"Minimum-Cost Network Flow with Dual Predictions","created":"2026-01-28","cited_by_count":0,"area":null},{"id":"2602.24232","title":"Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion","created":"2026-02-27","cited_by_count":0,"area":null},{"id":"2604.21175","title":"Graph Neural Network-Informed Predictive Flows for Faster Ford-Fulkerson and PAC-Learnability","created":"2026-04-23","cited_by_count":0,"area":null},{"id":"2604.26062","title":"Incremental Strongly Connected Components with Predictions","created":"2026-04-28","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}