Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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

Dynamic TCP Acknowledgment and Other Stories about e/(e - 1)

Karlin, Kenyon, Randall · 2003 · Algorithmica

Overview

Integrity signals

Registry

Crossref · 10.1007/s00453-003-1013-x

Cites

9 of 9 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 8 references

Cited by

See all 99

Metadata

Authors
Karlin, Kenyon, & Randall
Affiliations
  • École Polytechnique (FR)
  • Georgia Institute of Technology (US)
Venue
Algorithmica
Published
2003-07
Volume
36
Issue
3
Pages
209-224
ISSN
  • 0178-4617 (ISSN-L)
  • 1432-0541
OpenAlex
W2031816824
Cited by
73
References
8
Citations by year
2024: 2 · 2023: 2 · 2022: 5 · 2021: 5 · 2020: 6 · 2019: 4 · 2018: 3 · 2017: 4 · 2015: 3 · 2014: 3 · 2013: 6 · 2012: 2
FWCI
2.62
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
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
Keywords
ski rental problem, randomized online algorithms, competitive ratio, optimal online algorithms, online decision making

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: Dynamic TCP Acknowledgment and Other Stories about e/(e - 1). https://app.cochat.ai/papers/10.1007/s00453-003-1013-x
The paper
Karlin, Kenyon, & Randall. (2003). Dynamic TCP Acknowledgment and Other Stories about e/(e - 1). Algorithmica. https://doi.org/10.1007/s00453-003-1013-x

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.