On the public citation graph

Competitive odds and ends

https://doi.org/10.1007/bfb0029578
0 signed · 50 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/bf01189992openalex-snapshot
Thek-server dual and loose competitiveness for paging
inferredcites →https://doi.org/10.1007/bf01940643openalex-snapshot
Competitive distributed decision-making
inferredcites →https://doi.org/10.1016/0304-3975(94)90154-6openalex-snapshot
Competitive algorithms for the weighted server problem
inferredcites →https://doi.org/10.1016/s0304-3975(97)00006-6openalex-snapshot
Randomized algorithms for metrical task systems
inferredcites →https://doi.org/10.1109/sfcs.1991.185381openalex-snapshot
Competitive algorithms for layered graph traversal
inferredcites →https://doi.org/10.1109/sfcs.1992.267772openalex-snapshot
A decomposition theorem and bounds for randomized server problems
inferredcites →https://doi.org/10.1109/sfcs.1993.366886openalex-snapshot
On the value of information in coordination games
inferredcites →https://doi.org/10.1109/sfcs.1994.365676openalex-snapshot
A theory of competitive analysis for distributed algorithms
inferredcites →https://doi.org/10.1109/sfcs.1994.365677openalex-snapshot
Beyond competitive analysis [on-line algorithms]
inferredcites →https://doi.org/10.1109/sfcs.1995.492478openalex-snapshot
Speed is as powerful as clairvoyance [scheduling problems]
inferredcites →https://doi.org/10.1109/sfcs.1996.548477openalex-snapshot
Probabilistic approximation of metric spaces and its algorithmic applications
inferredcites →https://doi.org/10.1109/sfcs.1996.548497openalex-snapshot
Universal stability results for greedy contention-resolution protocols
inferredcites →https://doi.org/10.1137/s0097539794261428openalex-snapshot
On the Value of Coordination in Distributed Decision Making
inferredcites →https://doi.org/10.1137/s0097539796299540openalex-snapshot
Beyond Competitive Analysis
inferredcites →https://doi.org/10.1145/103418.103419openalex-snapshot
Navigating in unfamiliar geometric terrain
inferredcites →https://doi.org/10.1145/103418.103422openalex-snapshot
Competitive paging with locality of reference
inferredcites →https://doi.org/10.1145/103418.103450openalex-snapshot
Lower bounds for randomized k-server and motion-planning algorithms
inferredcites →https://doi.org/10.1145/167088.167127openalex-snapshot
Linear programming without the matrix
inferredcites →https://doi.org/10.1145/237814.237983openalex-snapshot
Distributed packet switching in arbitrary networks
inferredcites →https://doi.org/10.1145/237814.237984openalex-snapshot
Adversarial queueing theory
inferredcites →https://doi.org/10.1145/258533.258570openalex-snapshot
Optimal time-critical scheduling via resource augmentation (extended abstract)
inferredcites →https://doi.org/10.1145/258533.258659openalex-snapshot
Universal O(congestion + dilation + log1+εN) local control packet switching algorithms
inferredcites →https://doi.org/10.1145/258533.258667openalex-snapshot
A polylog( n )-competitive algorithm for metrical task systems
inferredcites →https://doi.org/10.1145/28395.28435openalex-snapshot
An optimal online algorithm for metrical task systems
inferredcites →https://doi.org/10.1145/347476.347479openalex-snapshot
Speed is as powerful as clairvoyance
inferredcites →https://doi.org/10.5555/127787.127832openalex-snapshot
On-line caching as cache size varies
inferredcites →https://doi.org/10.5555/313559.313847openalex-snapshot
On-line choice of on-line algorithms
inferredcites →https://doi.org/10.5555/313651.313779openalex-snapshot
On algorithm design for metrical task systems
inferredcites →https://doi.org/10.5555/313852.314122openalex-snapshot
Distributed paging for general networks
inferredcites →https://doi.org/10.5555/314161.314178openalex-snapshot
On page migration and other relaxed task systems
inferredcites →https://doi.org/10.5555/314161.314185openalex-snapshot
The k-client problem
inferredcites →https://doi.org/10.5555/314464.314574openalex-snapshot
Linear programs for randomized on-line algorithms
inferredcites →https://doi.org/10.5555/314613.314658openalex-snapshot
On-line file caching
inferredcites →https://doi.org/10.5555/320176.320216openalex-snapshot
Competitive randomized algorithms for non-uniform 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/3-540-48447-7_9openalex-snapshot
The Accomodating Function — A Generalization of the Competitive Ratio
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_2openalex-snapshot
Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
inferred← citeshttps://doi.org/10.1007/978-3-662-49192-8_22openalex-snapshot
The Complexity of Paging Against a Probabilistic Adversary
inferred← citeshttps://doi.org/10.1007/s10100-016-0455-6openalex-snapshot
Evaluating the quality of online optimization algorithms by discrete event simulation
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.10.029openalex-snapshot
Learning lexicographic orders
inferred← citeshttps://doi.org/10.1137/s0895480198342310openalex-snapshot
The Online Transportation Problem
inferred← citeshttps://doi.org/10.1145/1027914.1027930openalex-snapshot
SIGACT news online algorithms column 4
inferred← citeshttps://doi.org/10.1145/1086649.1086670openalex-snapshot
SIGACT news online algorithms column 8
inferred← citeshttps://doi.org/10.1145/1620491.1620508openalex-snapshot
SIGACT news online algorithms column 14
inferred← citeshttps://doi.org/10.1145/1711475.1711499openalex-snapshot
Introduction to the SIGACT news online algorithms column
inferred← citeshttps://doi.org/10.1145/1711475.1714372openalex-snapshot
On Developing New Models, with Paging as a Case Study
inferred← citeshttps://doi.org/10.1145/1753171.1753194openalex-snapshot
SIGACT news online algorithms column 16
inferred← citeshttps://doi.org/10.1145/1907450.1907547openalex-snapshot
SIGACT news online algorithms column 17
inferred← citeshttps://doi.org/10.1145/1998037.1998057openalex-snapshot
SIGACT news online algorithms column 19
inferred← citeshttps://doi.org/10.1145/954092.954104openalex-snapshot
SIGACT news online algorithms column 1
inferred← citeshttps://doi.org/10.3929/ethz-a-007089360openalex-snapshot
Advice and Randomization in Online Computation
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.