The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.
Online algorithms: a survey
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
Hypertext Transfer Protocol (HTTP)
(2003) · The Hacker's Handbook · doi:10.1201/9780203490044-20 · Cited by 2,824
Online Computation and Competitive Analysis
Borodin, A., & El‐Yaniv, R. (1998) · Cited by 2,333
A Block-sorting Lossless Data Compression Algorithm
Burrows, M. T., & Wheeler, D. J. (1994) · Cited by 2,333
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
A study of replacement algorithms for a virtual-storage computer
Belady, L. A. (1966) · IBM Systems Journal · doi:10.1147/sj.52.0078 · Cited by 1,659
Self-adjusting binary search trees
Sleator, D. D., & Tarjan, R. E. (1985) · Journal of the ACM · doi:10.1145/3828.3835 · Cited by 1,228
Approximation algorithms for bin packing: a survey
Coffman, E. G., Garey, M. R., & Johnson, D. S. (1996) · PWS Publishing Co. eBooks · Cited by 862
The working set model for program behavior
Denning, P. J. (1983) · Communications of the ACM · doi:10.1145/357980.357997 · Cited by 845
Speed is as powerful as clairvoyance
Kalyanasundaram, B., & Pruhs, K. (2000) · Journal of the ACM · doi:10.1145/347476.347479 · Cited by 561
A locally adaptive data compression scheme
Bentley, J. L., Sleator, D. D., Tarjan, R. E., & Wei, V. K. (1986) · Communications of the ACM · doi:10.1145/5684.5688 · Cited by 523
Cited by
Online learning: A comprehensive survey
Hoi, S. C. H., Sahoo, D., Lu, J., & Zhao, P. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.04.112 · Cited by 746
A survey on metaheuristics for stochastic combinatorial optimization
Bianchi, L., Dorigo, M., Gambardella, L. M., & Gutjahr, W. J. (2009) · Natural Computing · doi:10.1007/s11047-008-9098-4 · Cited by 737
Home energy management systems: A review of modelling and complexity
Beaudin, M., & Zareipour, H. (2015) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2015.01.046 · Cited by 471
A unified framework for stochastic optimization
Powell, W. B. (2019) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.07.014 · Cited by 314
Home Energy Management Systems: A Review of Modelling and Complexity
Beaudin, M., & Zareipour, H. (2017) · Lecture Notes in Energy · doi:10.1007/978-3-319-26950-4_35 · Cited by 254
Metadata
- Authors
- Albers, S.
- Venue
- Mathematical Programming
- Published
- 2003-07
- Volume
- 97
- Issue
- 1
- Pages
- 3-26
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W158123262
- Cited by
- 259
- References
- 57
- FWCI
- 4.36
- 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: Online algorithms: a survey. https://app.cochat.ai/papers/10.1007/s10107-003-0436-0
- The paper
- Albers, S. (2003). Online algorithms: a survey. Mathematical Programming. https://doi.org/10.1007/s10107-003-0436-0
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.