On the public citation graph
On convex body chasing
0 signed · 64 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/s0022-0000(05)80060-1openalex-snapshot
Competitive k-server algorithms
inferredcites →https://doi.org/10.1109/fscs.1990.89566openalex-snapshot
Competitive k-server algorithms
inferredcites →https://doi.org/10.1109/sfcs.1991.185381openalex-snapshot
Competitive algorithms for layered graph traversal
inferredcites →https://doi.org/10.1145/100216.100266openalex-snapshot
Random walks on weighted graphs, and applications to on-line algorithms
inferredcites →https://doi.org/10.1145/100216.100268openalex-snapshot
On the power of randomization in online algorithms
inferredcites →https://doi.org/10.1145/103418.103448openalex-snapshot
The harmonic online K -server algorithm is competitive
inferredcites →https://doi.org/10.1145/146585.146588openalex-snapshot
An optimal on-line algorithm for metrical task system
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/28395.28435openalex-snapshot
An optimal online algorithm for metrical task systems
inferredcites →https://doi.org/10.1145/62212.62243openalex-snapshot
Competitive algorithms for on-line problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1996.0024openalex-snapshot
Traversing Layered Graphs Using the Work Function Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_5openalex-snapshot
Algorithms for Energy Conservation in Heterogeneous Data Centers
inferred← citeshttps://doi.org/10.1007/978-3-031-26300-2_12openalex-snapshot
Chasing Convex Bodies Optimally
inferred← citeshttps://doi.org/10.1007/978-3-031-53510-9_10openalex-snapshot
Adversarial Online Reinforcement Learning Under Limited Defender Resources
inferred← citeshttps://doi.org/10.1007/978-3-032-27732-9_19openalex-snapshot
Online Drone Coverage of Targets on a Line
inferred← citeshttps://doi.org/10.1007/978-3-319-89441-6_13openalex-snapshot
A Tight Lower Bound for Online Convex Optimization with Switching Costs
inferred← citeshttps://doi.org/10.1007/978-3-319-89920-6_4openalex-snapshot
Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_10openalex-snapshot
Green Computing Algorithmics
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_6openalex-snapshot
Chasing Convex Bodies and Functions
inferred← citeshttps://doi.org/10.1007/s00453-019-00661-xopenalex-snapshot
Nested Convex Bodies are Chaseable
inferred← citeshttps://doi.org/10.1007/s00453-024-01244-1openalex-snapshot
Online Geometric Covering and Piercing
inferred← citeshttps://doi.org/10.1007/s00454-023-00491-3openalex-snapshot
Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.03.025openalex-snapshot
Online chasing problems for regular polygons
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.10.009openalex-snapshot
Algorithms for energy conservation in heterogeneous data centers
inferred← citeshttps://doi.org/10.1109/cdc.2017.8263834openalex-snapshot
Thinking fast and slow: Optimization decomposition across timescales
inferred← citeshttps://doi.org/10.1109/rivf.2007.369133openalex-snapshot
Online Chasing Problems for Regular n-Gons
inferred← citeshttps://doi.org/10.1109/tnet.2024.3350990openalex-snapshot
Combining Regularization With Look-Ahead for Competitive Online Convex Optimization
inferred← citeshttps://doi.org/10.1137/1.9781611975482.67openalex-snapshot
A PTAS for Euclidean TSP with Hyperplane Neighborhoods
inferred← citeshttps://doi.org/10.1137/1.9781611975994.91openalex-snapshot
Chasing Nested Convex Bodies Nearly Optimally
inferred← citeshttps://doi.org/10.1137/1.9781611976465.125openalex-snapshot
Online Multiserver Convex Chasing and Optimization
inferred← citeshttps://doi.org/10.1137/120885309openalex-snapshot
The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
inferred← citeshttps://doi.org/10.1137/20m1312332openalex-snapshot
Competitively Chasing Convex Bodies
inferred← citeshttps://doi.org/10.1137/s0097539795279943openalex-snapshot
Competitive Algorithms for Layered Graph Traversal
inferred← citeshttps://doi.org/10.1145/1147954.1147960openalex-snapshot
The generalized two-server problem
inferred← citeshttps://doi.org/10.1145/3300150.3300160openalex-snapshot
SIGACT News Online Algorithms Column 34
inferred← citeshttps://doi.org/10.1145/3305218.3305234openalex-snapshot
Smoothed Online Convex Optimization via Online Balanced Descent
inferred← citeshttps://doi.org/10.1145/3309697.3331495openalex-snapshot
Competitive Online Optimization under Inventory Constraints
inferred← citeshttps://doi.org/10.1145/3313276.3316314openalex-snapshot
Competitively chasing convex bodies
inferred← citeshttps://doi.org/10.1145/3322205.3311081openalex-snapshot
Competitive Online Optimization under Inventory Constraints
inferred← citeshttps://doi.org/10.1145/3374857.3374871openalex-snapshot
SIGACT News Online Algorithms Column 35
inferred← citeshttps://doi.org/10.1145/3376930.3376953openalex-snapshot
Competitive Online Optimization under Inventory Constraints
inferred← citeshttps://doi.org/10.1145/3450349openalex-snapshot
Chasing Convex Bodies with Linear Competitive Ratio
inferred← citeshttps://doi.org/10.1145/3530894openalex-snapshot
Expert-Calibrated Learning for Online Optimization with Switching Costs
inferred← citeshttps://doi.org/10.1145/3626776openalex-snapshot
The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
inferred← citeshttps://doi.org/10.1287/mnsc.2023.4739openalex-snapshot
Routing Optimization with Vehicle-Customer Coordination
inferred← citeshttps://doi.org/10.14279/depositonce-5427openalex-snapshot
Handling critical tasks online
inferred← citeshttps://doi.org/10.23919/acc55779.2023.10156405openalex-snapshot
On the Adversarial Convex Body Chasing Problem
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2020.54openalex-snapshot
Parametrized Metrical Task Systems
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.8openalex-snapshot
Better Bounds for Online Line Chasing
inferred← citeshttps://doi.org/10.48550/arxiv.1704.07785openalex-snapshot
Thinking Fast and Slow: Optimization Decomposition Across Timescales
inferred← citeshttps://doi.org/10.48550/arxiv.1803.10366openalex-snapshot
Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent
inferred← citeshttps://doi.org/10.48550/arxiv.1901.10604openalex-snapshot
Improved Path-length Regret Bounds for Bandits
inferred← citeshttps://doi.org/10.48550/arxiv.1905.11877openalex-snapshot
Chasing Convex Bodies with Linear Competitive Ratio
inferred← citeshttps://doi.org/10.48550/arxiv.1905.12776openalex-snapshot
Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1912.01698openalex-snapshot
Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2005.14058openalex-snapshot
Dimension-Free Bounds on Chasing Convex Functions
inferred← citeshttps://doi.org/10.48550/arxiv.2102.06933openalex-snapshot
Revisiting Smoothed Online Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2103.11055openalex-snapshot
Online Robust Control of Nonlinear Systems with Large Uncertainty
inferred← citeshttps://doi.org/10.5555/313559.313843openalex-snapshot
On traversing layered graphs on-line
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.