The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Beyond Competitive Analysis
Abstract
The competitive analysis of online algorithms has been criticized as being too crude and unrealistic. We propose refinements of competitive analysis in two directions: The first restricts the power of the adversary by allowing only certain input distributions, while the other allows for comparisons between information regimes for online decision-making. We illustrate the first with an application to the paging problem; as a byproduct we characterize completely the work functions of this important special case of the k-server problem. We use the second refinement to explore the power of lookahead in server and task systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Amortized efficiency of list update and paging rules
Sleator, D. D., & Tarjan, R. E. (1985) · Communications of the ACM · doi:10.1145/2786.2793 · Cited by 2,123
Fiat, A., Karp, R. M., Luby, M., McGeoch, L. A., Sleator, D. D., & Young, N. E. (1991) · Journal of Algorithms · doi:10.1016/0196-6774(91)90041-v · Cited by 457
Competitive algorithms for on-line problems
Manasse, M., McGeoch, L., & Sleator, D. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62243 · Cited by 358
An optimal on-line algorithm for metrical task system
Borodin, A., Linial, N., & Saks, M. E. (1992) · Journal of the ACM · doi:10.1145/146585.146588 · Cited by 326
Thek-server dual and loose competitiveness for paging
Young, N. (1994) · Algorithmica · doi:10.1007/bf01189992 · Cited by 252
Koutsoupias, E., & Papadimitriou, C. H. (1995) · Journal of the ACM · doi:10.1145/210118.210128 · Cited by 240
Self-citationA strongly competitive randomized paging algorithm
McGeoch, L. A., & Sleator, D. D. (1991) · Algorithmica · doi:10.1007/bf01759073 · Cited by 238
Competitive Paging with Locality of Reference
Borodin, A., Irani, S., Raghavan, P., & Schieber, B. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1021 · Cited by 165
A new measure for the study of on-line algorithms
Ben-David, S., & Borodin, A. (1994) · Algorithmica · doi:10.1007/bf01294264 · Cited by 141
Strongly Competitive Algorithms for Paging with Locality of Reference
Irani, S., Karlin, A. R., & Phillips, S. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539792236353 · Cited by 121
Cited by
Online algorithms for geographical load balancing
Lin, M., Liu, Z., Wierman, A., & Andrew, L. L. H. (2012) · 2012 International Green Computing Conference (IGCC) · doi:10.1109/igcc.2012.6322266 · Cited by 290
Competitive analysis of randomized paging algorithms
Achlioptas, D., Chrobak, M., & Noga, J. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00116-9 · Cited by 127
Young, N. E. (2002) · Algorithmica · doi:10.1007/s00453-001-0124-5 · Cited by 105
Metadata
- Authors
- Koutsoupias, E., & Papadimitriou, C. H.
- Venue
- SIAM Journal on Computing
- Published
- 2000-01
- Volume
- 30
- Issue
- 1
- Pages
- 300-317
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2159472851
- Cited by
- 277
- References
- 16
- FWCI
- 19.62
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Beyond Competitive Analysis. https://app.cochat.ai/papers/10.1137/s0097539796299540
- The paper
- Koutsoupias, E., & Papadimitriou, C. H. (2000). Beyond Competitive Analysis. SIAM Journal on Computing. https://doi.org/10.1137/s0097539796299540
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.