The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
On the power of randomization in on-line algorithms
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
Karlin, A. R., Manasse, M. S., Rudolph, L., & Sleator, D. D. (1988) · Algorithmica · doi:10.1007/bf01762111 · Cited by 631
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
Self-citationCompetitive algorithms for server problems
Manasse, M. S., McGeoch, L. A., & Sleator, D. D. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90003-w · Cited by 425
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
Self-citationA strongly competitive randomized paging algorithm
McGeoch, L. A., & Sleator, D. D. (1991) · Algorithmica · doi:10.1007/bf01759073 · Cited by 238
An optimal online algorithm for metrical task systems
Borodin, A., Linial, N., & Saks, M. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28435 · Cited by 164
Self-citationCompetitive k-server algorithms
Fiat, A., Rabani, Y., & Ravid, Y. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80060-1 · Cited by 135
Memory versus randomization in on-line algorithms
Raghavan, P., & Snir, M. (1989) · Lecture notes in computer science · doi:10.1007/bfb0035792 · Cited by 74
Cited by
Beloglazov, A., & Buyya, R. (2012) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.1867 · Cited by 1,864
Probabilistic approximation of metric spaces and its algorithmic applications
Bartal, Y. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548477 · Cited by 635
Competitive randomized algorithms for nonuniform problems
Karlin, A. R., Manasse, M. S., McGeoch, L. A., & Owicki, S. (1994) · Algorithmica · doi:10.1007/bf01189993 · Cited by 258
Thek-server dual and loose competitiveness for paging
Young, N. (1994) · Algorithmica · doi:10.1007/bf01189992 · Cited by 252
Metadata
- Authors
- Ben-David, S., Borodin, A., Karp, R., Tardos, G., & Wigderson, A.
- Venue
- Algorithmica
- Published
- 1994-01
- Volume
- 11
- Issue
- 1
- Pages
- 2-14
- ISSN
- 0178-4617 (ISSN-L)
- 1432-0541
- OpenAlex
- W2056760235
- Cited by
- 262
- References
- 15
- FWCI
- 16.81
- 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
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.