On the public citation graph

Online Metric Algorithms with Untrusted Predictions

0 signed · 87 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1994.1009openalex-snapshot
The Weighted Majority Algorithm
inferredcites →https://doi.org/10.1006/jagm.1993.1026openalex-snapshot
Online Weighted Matching
inferredcites →https://doi.org/10.1006/jcss.1997.1504openalex-snapshot
A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
inferredcites →https://doi.org/10.1007/bfb0029565openalex-snapshot
Metrical task systems, the server problem and the work function algorithm
inferredcites →https://doi.org/10.1016/0196-6774(90)90003-wopenalex-snapshot
Competitive algorithms for server problems
inferredcites →https://doi.org/10.1016/0196-6774(91)90041-vopenalex-snapshot
Competitive paging algorithms
inferredcites →https://doi.org/10.1016/0304-3975(94)90042-6openalex-snapshot
On-line algorithms for weighted bipartite matching and stable marriages
inferredcites →https://doi.org/10.1016/j.tcs.2004.10.028openalex-snapshot
Online matching on a line
inferredcites →https://doi.org/10.1016/j.tcs.2010.08.007openalex-snapshot
Online computation with advice
inferredcites →https://doi.org/10.1016/s0022-0000(05)80060-1openalex-snapshot
Competitive k-server algorithms
inferredcites →https://doi.org/10.1023/a:1007621832648openalex-snapshot
On-line Learning and the Metrical Task System Problem
inferredcites →https://doi.org/10.1109/infcom.2011.5934885openalex-snapshot
Dynamic right-sizing for power-proportional data centers
inferredcites →https://doi.org/10.1109/tnet.2012.2226216openalex-snapshot
Dynamic Right-Sizing for Power-Proportional Data Centers
inferredcites →https://doi.org/10.1137/1.9781611975482.6openalex-snapshot
Metrical task systems on trees via mirror descent and unfair gluing
inferredcites →https://doi.org/10.1137/1.9781611975994.112openalex-snapshot
Near-Optimal Bounds for Online Caching with Machine Learned Advice
inferredcites →https://doi.org/10.1137/1.9781611975994.114openalex-snapshot
Online Scheduling via Learned Weights
inferredcites →https://doi.org/10.1137/s0097539792224838openalex-snapshot
Lower Bounds for Randomized k -Server and Motion-Planning Algorithms
inferredcites →https://doi.org/10.1137/s0097539795279943openalex-snapshot
Competitive Algorithms for Layered Graph Traversal
inferredcites →https://doi.org/10.1145/146585.146588openalex-snapshot
An optimal on-line algorithm for metrical task system
inferredcites →https://doi.org/10.1145/180139.181097openalex-snapshot
Approximate methods for sequential decision making using expert advice
inferredcites →https://doi.org/10.1145/2020408.2020579openalex-snapshot
Friendship and mobility
inferredcites →https://doi.org/10.1145/2071379.2071381openalex-snapshot
Online Optimization with Uncertain Information
inferredcites →https://doi.org/10.1145/2339123.2339126openalex-snapshot
A Primal-Dual Randomized Algorithm for Weighted Paging
inferredcites →https://doi.org/10.1145/2566486.2568018openalex-snapshot
The dynamics of repeat consumption
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/3007787.3001146openalex-snapshot
Back to the future
inferredcites →https://doi.org/10.1145/3056461openalex-snapshot
Online Algorithms with Advice
inferredcites →https://doi.org/10.1145/3183713.3196909openalex-snapshot
The Case for Learned Index Structures
inferredcites →https://doi.org/10.1145/3313276.3316370openalex-snapshot
The online 𝑘-taxi problem
inferredcites →https://doi.org/10.1145/3352460.3358319openalex-snapshot
Applying Deep Learning to the Cache Replacement Problem
inferredcites →https://doi.org/10.1145/3548774openalex-snapshot
Online Algorithms for Weighted Paging with Predictions
inferredcites →https://doi.org/10.1145/860176.860180openalex-snapshot
Online strategies for dynamic power management in systems with multiple power-saving states
inferredcites →https://doi.org/10.1147/sj.52.0078openalex-snapshot
A study of replacement algorithms for a virtual-storage computer
inferredcites →https://doi.org/10.24963/ijcai.2017/92openalex-snapshot
Learning to Run Heuristics in Tree Search
inferredcites →https://doi.org/10.4230/lipics.icalp.2017.126openalex-snapshot
Stochastic k-Server: How Should Uber Work?
inferredcites →https://doi.org/10.4230/lipics.itcs.2020.14openalex-snapshot
Scheduling with Predictions and the Price of Misprediction
inferredcites →https://doi.org/10.4230/lipics.itcs.2020.52openalex-snapshot
Online Computation with Untrusted Advice
inferredcites →https://doi.org/10.4230/lipics.socg.2018.67openalex-snapshot
Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line
inferredcites →https://doi.org/10.48550/arxiv.1706.04732openalex-snapshot
Revenue Optimization with Approximate Bid Predictions
inferredcites →https://doi.org/10.48550/arxiv.1906.04270openalex-snapshot
Pure entropic regularization for metrical task systems
inferredcites →https://doi.org/10.48550/arxiv.2407.17712openalex-snapshot
Improving Online Algorithms via ML Predictions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00453-024-01239-yopenalex-snapshot
Online Unit Profit Knapsack with Predictions
inferred← citeshttps://doi.org/10.1007/s00453-025-01333-9openalex-snapshot
Boosting Double Coverage for k-Server via Imperfect Predictions
inferred← citeshttps://doi.org/10.1007/s11227-025-07448-8openalex-snapshot
SUL32C: secure ultra-lightweight 32-bit cipher for IoT devices
inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106569openalex-snapshot
Online delay management on a single train line with predictions
inferred← citeshttps://doi.org/10.1109/access.2024.3504541openalex-snapshot
Revisiting Online Algorithms: A Survey of Set Cover Solutions Beyond Competitive Analysis
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10228882openalex-snapshot
Online Dynamic Acknowledgement with Learned Predictions
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10228998openalex-snapshot
Robustified Learning for Online Optimization with Memory Costs
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834539openalex-snapshot
Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size Messages
inferred← citeshttps://doi.org/10.1109/noms59830.2024.10575387openalex-snapshot
Latency-Aware Cache Mechanism for Resolver Service of Domain Name Systems
inferred← citeshttps://doi.org/10.1137/1.9781611976830.3openalex-snapshot
Using Predicted Weights for Ad Delivery
inferred← citeshttps://doi.org/10.1137/1.9781611977073.4openalex-snapshot
Learning-Augmented Weighted Paging
inferred← citeshttps://doi.org/10.1145/3409964.3461790openalex-snapshot
Non-Clairvoyant Scheduling with Predictions
inferred← citeshttps://doi.org/10.1145/3508038openalex-snapshot
Robustness and Consistency in Linear Quadratic Control with Untrusted Predictions
inferred← citeshttps://doi.org/10.1145/3530894openalex-snapshot
Expert-Calibrated Learning for Online Optimization with Switching Costs
inferred← citeshttps://doi.org/10.1145/3548774openalex-snapshot
Online Algorithms for Weighted Paging with Predictions
inferred← citeshttps://doi.org/10.1145/3586165.3586177openalex-snapshot
SIGACT News Online Algorithms Column 40
inferred← citeshttps://doi.org/10.1145/3594873openalex-snapshot
Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm
inferred← citeshttps://doi.org/10.1145/3626570.3626590openalex-snapshot
Trade-off Analysis in Learning-augmented Algorithms with Societal Design Criteria
inferred← citeshttps://doi.org/10.1145/3670865.3673578openalex-snapshot
To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model
inferred← citeshttps://doi.org/10.1145/3700420openalex-snapshot
Learning-Augmented Decentralized Online Convex Optimization in Networks
inferred← citeshttps://doi.org/10.1145/3711872openalex-snapshot
Permutation Predictions for Non-Clairvoyant Scheduling
inferred← citeshttps://doi.org/10.1145/3763239openalex-snapshot
Improved Learning-Augmented Algorithms and (Tight) Lower Bounds for Multi-Option Ski Rental Problem
inferred← citeshttps://doi.org/10.1287/opre.2025.1646openalex-snapshot
Online Metric Matching: Beyond the Worst Case
inferred← citeshttps://doi.org/10.14778/3574245.3574271openalex-snapshot
Making Cache Monotonic and Consistent
inferred← citeshttps://doi.org/10.1609/aaai.v35i12.17294openalex-snapshot
Data-driven Competitive Algorithms for Online Knapsack and Set Cover
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17394openalex-snapshot
Contract Scheduling With Predictions
inferred← citeshttps://doi.org/10.1609/aaai.v36i8.20854openalex-snapshot
Learning-Augmented Algorithms for Online Steiner Tree
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21199openalex-snapshot
Online Search with Best-Price and Query-Based Predictions
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21208openalex-snapshot
Robustification of Online Graph Exploration Methods
inferred← citeshttps://doi.org/10.1609/aaai.v37i10.26414openalex-snapshot
Learning-Augmented Algorithms for Online TSP on the Line
inferred← citeshttps://doi.org/10.1609/aaai.v37i10.26430openalex-snapshot
Smoothed Online Combinatorial Optimization Using Imperfect Predictions
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19827openalex-snapshot
Uniform Machine Scheduling with Predictions
inferred← citeshttps://doi.org/10.1613/jair.1.14117openalex-snapshot
Contract Scheduling with Predictions
inferred← citeshttps://doi.org/10.1613/jair.1.14820openalex-snapshot
Online Bin Packing with Predictions
inferred← citeshttps://doi.org/10.18653/v1/2023.sustainlp-1.1openalex-snapshot
KwikBucks: Correlation Clustering with Cheap-Weak and Expensive-Strong Signals
inferred← citeshttps://doi.org/10.24963/ijcai.2022/632openalex-snapshot
Efficient Document-level Event Extraction via Pseudo-Trigger-aware Pruned Complete Graph
inferred← citeshttps://doi.org/10.24963/ijcai.2022/636openalex-snapshot
Scheduling with Untrusted Predictions
inferred← citeshttps://doi.org/10.24963/ijcai.2023/3openalex-snapshot
Proportionally Fair Online Allocation of Public Goods with Predictions
inferred← citeshttps://doi.org/10.26092/elib/4261openalex-snapshot
Double Coverage with Machine-Learned Advice
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.59openalex-snapshot
Graph Searching with Predictions
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2021.67openalex-snapshot
Online Paging with a Vanishing Regret
inferred← citeshttps://doi.org/10.48550/arxiv.1908.05198openalex-snapshot
(Learned) Frequency Estimation Algorithms under Zipfian Distribution
inferred← citeshttps://doi.org/10.48550/arxiv.2105.12086openalex-snapshot
An $Ω(\log n)$ Lower Bound for Online Matching on the Line
inferred← citeshttps://doi.org/10.48550/arxiv.2109.01556openalex-snapshot
Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2110.00391openalex-snapshot
Online Primal-Dual Algorithms with Predictions for Packing Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2304.01781openalex-snapshot
Mixing predictions for online metric algorithms
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.