On the public citation graph

Online Algorithms for Weighted Paging with Predictions

0 signed · 38 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.1007/pl00009158openalex-snapshot
On the Influence of Lookahead in Competitive Paging Algorithms
inferredcites →https://doi.org/10.1007/s00453-001-0124-5openalex-snapshot
On-Line File Caching
inferredcites →https://doi.org/10.1016/0196-6774(91)90041-vopenalex-snapshot
Competitive paging algorithms
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1137/0404017openalex-snapshot
New Ressults on Server Problems
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.1145/1390156openalex-snapshot
Proceedings of the 25th international conference on Machine learning - ICML '08
inferredcites →https://doi.org/10.1145/2339123.2339126openalex-snapshot
A Primal-Dual Randomized Algorithm for Weighted Paging
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/3447579openalex-snapshot
Competitive Caching with Machine Learned Advice
inferredcites →https://doi.org/10.1145/3582689openalex-snapshot
Online Metric Algorithms with Untrusted Predictions
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.48550/arxiv.1901.00902openalex-snapshot
A Model for Learned Bloom Filters, and Optimizing by Sandwiching
inferredcites →https://doi.org/10.48550/arxiv.2407.17712openalex-snapshot
Improving Online Algorithms via ML Predictions
inferredcites →https://doi.org/10.5555/127787.127832openalex-snapshot
On-line caching as cache size varies

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-43421-1_20openalex-snapshot
Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms
inferred← citeshttps://doi.org/10.1007/978-981-95-4839-2_20openalex-snapshot
Prediction-Augmented Mechanism Design for Weighted Facility Location
inferred← citeshttps://doi.org/10.1007/s00453-024-01239-yopenalex-snapshot
Online Unit Profit Knapsack with Predictions
inferred← citeshttps://doi.org/10.1007/s10898-022-01156-wopenalex-snapshot
Learning-augmented algorithms for online subset sum
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/infocom48880.2022.9796969openalex-snapshot
Online File Caching in Latency-Sensitive Systems with Delayed Hits and Bypassing
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10228882openalex-snapshot
Online Dynamic Acknowledgement with Learned Predictions
inferred← citeshttps://doi.org/10.1109/ton.2025.3549289openalex-snapshot
Asymptotically Tight Approximation for Online File Caching With Delayed Hits and Bypassing
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/3444815.3444830openalex-snapshot
SIGACT News Online Algorithms Column 36
inferred← citeshttps://doi.org/10.1145/3582689openalex-snapshot
Online Metric Algorithms with Untrusted Predictions
inferred← citeshttps://doi.org/10.1145/3670865.3673586openalex-snapshot
Competitive Auctions with Imperfect Predictions
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.1145/3786648openalex-snapshot
Enumerating Graph Pattern Matches with ML Oracles
inferred← citeshttps://doi.org/10.1609/aaai.v36i8.20854openalex-snapshot
Learning-Augmented Algorithms for Online Steiner Tree
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.48550/arxiv.2111.05257openalex-snapshot
Logarithmic Regret from Sublinear Hints
inferred← citeshttps://doi.org/10.65109/xdvf4075openalex-snapshot
Sequential Ski Rental Problem
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.