On the public citation graph

Metrical task systems, the server problem and the work function algorithm

0 signed · 42 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.1993.1054openalex-snapshot
Searching in the Plane
inferredcites →https://doi.org/10.1006/jagm.1994.1011openalex-snapshot
Generosity Helps or an 11-Competitive Algorithm for Three Servers
inferredcites →https://doi.org/10.1006/jagm.1996.0024openalex-snapshot
Traversing Layered Graphs Using the Work Function Algorithm
inferredcites →https://doi.org/10.1007/bfb0035787openalex-snapshot
Shortest paths without a map
inferredcites →https://doi.org/10.1016/0020-0190(96)00010-5openalex-snapshot
The 2-evader problem
inferredcites →https://doi.org/10.1016/0196-6774(90)90003-wopenalex-snapshot
Competitive algorithms for server problems
inferredcites →https://doi.org/10.1090/dimacs/007/02openalex-snapshot
The server problem and on-line games
inferredcites →https://doi.org/10.1109/fscs.1990.89554openalex-snapshot
Exploring an unknown graph
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.1137/0220008openalex-snapshot
An Optimal On-Line Algorithm for K Servers on Trees
inferredcites →https://doi.org/10.1137/0404017openalex-snapshot
New Ressults on Server Problems
inferredcites →https://doi.org/10.1137/0404029openalex-snapshot
A New Approach to the Server Problem
inferredcites →https://doi.org/10.1145/103418.103448openalex-snapshot
The harmonic online K -server algorithm is competitive
inferredcites →https://doi.org/10.1145/195058.195245openalex-snapshot
On the k -server conjecture
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.1007/11537311_25openalex-snapshot
The Delayed k-Server Problem
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_23openalex-snapshot
Analysis of the Harmonic Algorithm for Three Servers
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_49openalex-snapshot
The Weighted 2-Server Problem
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_27openalex-snapshot
The 3-Server Problem in the Plane
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_229openalex-snapshot
Metrical Task Systems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_28openalex-snapshot
Advanced Techniques for Dynamic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_484openalex-snapshot
Work-Function Algorithm for k-Servers
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_484-2openalex-snapshot
Work-Function Algorithm for k-Servers
inferred← citeshttps://doi.org/10.1007/s00453-019-00661-xopenalex-snapshot
Nested Convex Bodies are Chaseable
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.03.002openalex-snapshot
The online k -server problem with rejection
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.06.001openalex-snapshot
Uniform metrical task systems with a limited number of states
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.05.020openalex-snapshot
The weighted 2-server problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.022openalex-snapshot
A randomized algorithm for two servers in cross polytope spaces
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00070-3openalex-snapshot
A simple analysis of the harmonic algorithm for two servers
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00305-xopenalex-snapshot
The 3-server problem in the plane
inferred← citeshttps://doi.org/10.1109/focs.2017.52openalex-snapshot
Weighted k-Server Bounds via Combinatorial Dichotomies
inferred← citeshttps://doi.org/10.1109/icde.2009.155openalex-snapshot
Online Tuning of Aggregation Tables for OLAP
inferred← citeshttps://doi.org/10.1109/ispan.2004.1300497openalex-snapshot
Knowledge states for the caching problem in shared memory multiprocessor systems
inferred← citeshttps://doi.org/10.1109/ispan.2005.5openalex-snapshot
A Better Algorithm for Uniform Metrical Task Systems with Few States
inferred← citeshttps://doi.org/10.1142/s0129054109006504openalex-snapshot
KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS
inferred← citeshttps://doi.org/10.1145/3582689openalex-snapshot
Online Metric Algorithms with Untrusted Predictions
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.8openalex-snapshot
Better Bounds for Online Line Chasing
inferred← citeshttps://doi.org/10.48550/arxiv.1203.4920openalex-snapshot
Work function algorithm can forget history without losing competitiveness
inferred← citeshttps://doi.org/10.48550/arxiv.1704.03318openalex-snapshot
Weighted k-Server Bounds via Combinatorial Dichotomies
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0611088openalex-snapshot
T-Theory Applications to Online Algorithms for the Server 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.