The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
On the power of randomization in online algorithms
Abstract
No abstract available.
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
Karlin, A. R., Manasse, M. S., Rudolph, L., & Sleator, D. D. (1988) · Algorithmica · doi:10.1007/bf01762111 · Cited by 631 · cited 2×
“But as evident in the discussion provided by Karlin, et al [11] the issue transcends particular problems in data structures or paging.”
BackgroundMethodFiat, 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
Self-citationA strongly competitive randomized paging algorithm
McGeoch, L. A., & Sleator, D. D. (1991) · Algorithmica · doi:10.1007/bf01759073 · Cited by 238
Cited by
Beloglazov, A., & Buyya, R. (2012) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.1867 · Cited by 1,864
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
Self-citationAjtai, M., Aspnes, J., Naor, M., Rabani, Y., Schulman, L. J., & Waarts, O. (1998) · Journal of Algorithms · doi:10.1006/jagm.1998.0953 · Cited by 47
Metadata
- Authors
- Ben-David, S., Borodin, A., Karp, R., Tardos, G., & Wigderson, A.
- Venue
- Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90
- Publisher
- ACM Press
- Published
- 1990
- Pages
- 379-386
- OpenAlex
- W2073083283
- Cited by
- 174
- References
- 3
- FWCI
- 14.18
- Type
- conference paper
- 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: On the power of randomization in online algorithms. https://app.cochat.ai/papers/10.1145/100216.100268
- The paper
- Ben-David, S., Borodin, A., Karp, R., Tardos, G., & Wigderson, A. (1990). On the power of randomization in online algorithms. Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90. https://doi.org/10.1145/100216.100268
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.