The DOI matches its Crossref record.
Introduction to Algorithms
Abstract
A central theme in computing is the design of a process for carrying out a task. The task might be sorting names into alphabetical order, finding the cheapest way to link a set of computing sites into a network, converting a number to its representation in the binary system, encrypting a message for secure transmission, designing a digital circuit for a microchip, or determining the shortest path to be followed by a robotic arm. There will be many occasions throughout this book when we will find ourselves investigating problems of this nature, and asking: How can this task be performed by a person or a computer? In each case, the answer will take the form of a precise sequence of steps known as an algorithm .
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
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
A survey of intrusion detection techniques for cyber-physical systems
Mitchell, R., & Chen, I.-R. (2014) · ACM Computing Surveys · doi:10.1145/2542049 · Cited by 768
Locating in fingerprint space: wireless indoor localization with little human intervention
Yang, Z., Wu, C., & Liu, Y. (2012) · Proceedings of the 18th annual international conference on Mobile computing and networking · doi:10.1145/2348543.2348578 · Cited by 739
Topological persistence and simplification
Edelsbrunner, H., Letscher, D., & Zomorodian, A. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892133 · Cited by 652
Lin, T., & Zha, H. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70735 · Cited by 446
Metadata
- Authors
- Grossman, P.
- Venue
- Discrete Mathematics for Computing
- Publisher
- Macmillan Education UK
- Published
- 1995
- Pages
- 1-13
- OpenAlex
- W2753693129
- Cited by
- 672
- References
- 0
- FWCI
- 8.35
- 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-349-13908-8_1
- The paper
- Grossman, P. (1995). Introduction to Algorithms. Discrete Mathematics for Computing. https://doi.org/10.1007/978-1-349-13908-8_1
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.