The DOI matches its Crossref record.
Introduction to Algorithms
Abstract
We briefly discussed what we mean by algorithms in Chapter 1 , but perhaps it bears repeating; algorithms are recipes for solving a specific computational problem. They describe the steps you (or more usually your computer) must take to get from input to output and should guarantee you that if you follow the instructions exactly, you will (1) finish after a finite number of steps and (2) your output will be a solution to the problem they should solve, given the input you had.
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
Cited by
Stability of Persistence Diagrams
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-006-1276-5 · Cited by 1,280
Bai, F., Sadagopan, N., & Helmy, A. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00040-4 · Cited by 462
GitHub Copilot AI pair programmer: Asset or Liability?
Moradi Dakhel, A., Majdinasab, V., Nikanjam, A., Khomh, F., Desmarais, M. C., & Jiang, Z. M. (. (2023) · Journal of Systems and Software · doi:10.1016/j.jss.2023.111734 · Cited by 417
Luong, N. C., Hoang, D. T., Wang, P., Niyato, D., Kim, D. I., & Han, Z. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2582841 · Cited by 357
How to calculate the fractal dimension of a complex network: the box covering algorithm
Song, C., Gallos, L. K., Havlin, S., & Makse, H. A. (2007) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2007/03/p03006 · Cited by 345
Metadata
- Authors
- Mailund, T.
- Venue
- Introduction to Computational Thinking
- Publisher
- Apress
- Published
- 2021
- Pages
- 41-64
- OpenAlex
- W3183881215
- Cited by
- 877
- References
- 0
- FWCI
- 222.22
- Type
- book chapter
- 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: Introduction to Algorithms. https://app.cochat.ai/papers/10.1007/978-1-4842-7077-6_3
- The paper
- Mailund, T. (2021). Introduction to Algorithms. Introduction to Computational Thinking. https://doi.org/10.1007/978-1-4842-7077-6_3
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.
