The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
The algorithm design manual
Abstract
....The most comprehensive guide to designing practical and efficient algorithms!.... The Algorithm Design Manual, Second Edition ...the book is an algorithm-implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations [and] extensive bibliography make the book an invaluable resource for everyone interested in the subject. --ACM Computing Reviews It has all the right ingredients: rich contents, friendly, personal language, subtle humor, the right references, and a plethora of pointers to resources.-- P. Takis Metaxas, Wellesley College is the most approachable book on algorithms I have. -- Megan Squire, Elon University, USA This newly expanded and updated second edition of the best-selling classic continues to take the mystery out of designing algorithms, and analyzing their efficacy and efficiency. Expanding onthe first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students. The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instructionon methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography. NEW to the second edition: Doubles the tutorial material and exercises over the first edition Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video Contains a unique catalog identifying the 75 algorithmic that arise most often in practice, leading the reader down the right path to solve them Includes several NEW war stories relating experiences from real-world applications Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java ADDITIONAL Learning Tools: Exercises include job interview problems from major software companies Highlighted take-home lesson boxes emphasize essential concepts Provides comprehensive references to both survey articles and the primary literature Exercises points to relevant programming contest challenge Many algorithms presented with actual code (written in C) as well as pseudo-code A full set of lecture slides and additional material available at www.algorist.com Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this new edition of The Algorithm Design Manual is an essential learning tool for students needing a solid grounding in algorithms, as well as a special text/reference for professionals who need an authoritative and insightful guide. Professor Skiena is also author of the popular Springer text, Programming Challenges: The Programming Contest Training Manual.
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
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
College Admissions and the Stability of Marriage
Gale, D., & Shapley, L. S. (1962) · The American Mathematical Monthly · doi:10.1080/00029890.1962.11989827 · Cited by 5,985
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Recognition and parsing of context-free languages in time n3
Younger, D. H. (1967) · Information and Control · doi:10.1016/s0019-9958(67)80007-x · Cited by 935
Cited by
Reactome pathway analysis: a high-performance in-memory approach
Fabregat, A., Sidiropoulos, K., Viteri, G., Forner, O., Marin-Garcia, P., Arnau, V., D’Eustachio, P., Stein, L., & Hermjakob, H. (2017) · BMC Bioinformatics · doi:10.1186/s12859-017-1559-2 · Cited by 873
How to apply de Bruijn graphs to genome assembly
Compeau, P. E. C., Pevzner, P. A., & Tesler, G. (2011) · Nature Biotechnology · doi:10.1038/nbt.2023 · Cited by 673
PARAMETERIZED COMPLEXITY THEORY
Niedermeier, R. (2006) · Invitation to Fixed-Parameter Algorithms · doi:10.1093/acprof:oso/9780198566076.003.0013 · Cited by 574
Toward an Ethics of Algorithms: Convening, Observation, Probability, and Timeliness
Ananny, M. (2016) · Science, Technology, & Human Values · doi:10.1177/0162243915606523 · Cited by 395
Canhoto, A. I., & Clear, F. (2020) · Business Horizons · doi:10.1016/j.bushor.2019.11.003 · Cited by 375
Metadata
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 1998-07-01
- Volume
- 35
- Issue
- 11
- Pages
- 35-6287-35-6287
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W2161420356
- Cited by
- 904
- References
- 6
- Type
- book review
- 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: The algorithm design manual. https://app.cochat.ai/papers/10.5860/choice.35-6287
- The paper
- The algorithm design manual. (1998). Choice Reviews Online. https://doi.org/10.5860/choice.35-6287
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.