CoChat

Competitive randomized algorithms for nonuniform problems

The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.

Overview

Integrity signals

Registry

Crossref · 10.1007/bf01189993

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 19 references

Research works printed but not linked: 1

  1. McGeoch, L. A. Algorithms for Two Graph Problems. Ph.D. thesis, Carnegie Mellon University, 1987.

Cited by

Items 101–200 of 258

Metadata

Authors
Karlin, A. R., Manasse, M. S., McGeoch, L. A., & Owicki, S.
Affiliations
Amherst College (US)
Venue
Algorithmica
Published
1994-06
Volume
11
Issue
6
Pages
542-571
ISSN
  • 0178-4617 (ISSN-L)
  • 1432-0541
OpenAlex
W3137684744
Cited by
258
References
19
Citations by year
2026: 4 · 2025: 7 · 2024: 10 · 2023: 5 · 2022: 8 · 2021: 10 · 2020: 11 · 2019: 8 · 2018: 11 · 2017: 9 · 2016: 8 · 2015: 9 · 2014: 12 · 2013: 10 · 2012: 10
FWCI
2.88
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
Algorithmica (publishedVersion)
Topics
  • Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems
  • Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
Keywords
competitive analysis, randomized online algorithms, oblivious adversary, adaptive algorithms, request sequences, performance ratio, isosceles triangles

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

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.