The DOI matches its Crossref record; 110 of the 110 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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
(1979) · Cited by 43,841
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
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
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
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
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
Matsumoto, M., & Nishimura, T. (1998) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/272991.272995 · Cited by 5,780
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Shortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Floyd, R. W. (1962) · Communications of the ACM · doi:10.1145/367766.368168 · Cited by 3,998
Algorithmic Graph Theory and Perfect Graphs
(2004) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(04)x8001-8 · Cited by 3,729
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,310
Brooks, F. P. (1975) · ACM SIGPLAN Notices · doi:10.1145/390016.808439 · Cited by 3,224
The String-to-String Correction Problem
Wagner, R. A., & Fischer, M. J. (1974) · Journal of the ACM · doi:10.1145/321796.321811 · Cited by 3,032
Pólya, G. (1945) · Cited by 3,006
Andrews, G. E. (1984) · Cambridge University Press eBooks · doi:10.1017/cbo9780511608650 · Cited by 2,993
Efficient string matching: an aid to bibliographic search
Aho, A. V., & Corasick, M. J. (1975) · Communications of the ACM · doi:10.1145/360825.360855 · Cited by 2,944
Fast Pattern Matching in Strings
Knuth, D. E., Morris, Jr., & Pratt, V. R. (1977) · SIAM Journal on Computing · doi:10.1137/0206024 · Cited by 2,936
Algorithms for Minimization Without Derivatives
G., D., & Brent, R. P. (1974) · Mathematics of Computation · doi:10.2307/2005713 · Cited by 2,847
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
Bellman, R. (1958) · Quarterly of Applied Mathematics · doi:10.1090/qam/102435 · Cited by 2,758
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
A fast string searching algorithm
Boyer, R. S., & Moore, J. S. (1977) · Communications of the ACM · doi:10.1145/359842.359859 · Cited by 2,290
Approximation algorithms for combinatorial problems
Johnson, D. S. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80044-9 · Cited by 2,197
Polynomial algorithms in linear programming
Khachiyan, L. G. (1980) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(80)90061-0 · Cited by 1,992
An Introduction to the Theory of Numbers.
LeVeque, W. J., Niven, I., & Zuckerman, H. S. (1961) · The American Mathematical Monthly · doi:10.2307/2311171 · Cited by 1,907
Linear pattern matching algorithms
Weiner, P. (1973) · 14th Annual Symposium on Switching and Automata Theory (swat 1973) · doi:10.1109/swat.1973.13 · Cited by 1,801
Björck, Å., Dahlquist, G. G., & Anderson, N. (1974) · Cited by 1,719
Warshall, S. (1962) · Journal of the ACM · doi:10.1145/321105.321107 · Cited by 1,683
Numerical Methods for Scientists and Engineers
Hamming, R. W. (1962) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,677
On the shape of a set of points in the plane
Edelsbrunner, H., Kirkpatrick, D., & Seidel, R. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056714 · Cited by 1,634
New methods to color the vertices of a graph
Brélaz, D. (1979) · Communications of the ACM · doi:10.1145/359094.359101 · Cited by 1,567
A Space-Economical Suffix Tree Construction Algorithm
McCreight, E. M. (1976) · Journal of the ACM · doi:10.1145/321941.321946 · Cited by 1,511
Reducing the bandwidth of sparse symmetric matrices
Cuthill, E., & McKee, J. (1969) · Proceedings of the 1969 24th national conference on - · doi:10.1145/800195.805928 · Cited by 1,457
Algorithms for Graphics and Image Processing
Pavlidis, T. (1982) · Springer eBooks · doi:10.1007/978-3-642-93208-3 · Cited by 1,447
Gries, D. (1981) · Springer eBooks · doi:10.1007/978-1-4612-5983-1 · Cited by 1,433
Efficiency of a Good But Not Linear Set Union Algorithm
Tarjan, R. E. (1975) · Journal of the ACM · doi:10.1145/321879.321884 · Cited by 1,403
A Separator Theorem for Planar Graphs
Lipton, R. J., & Tarjan, R. E. (1979) · SIAM Journal on Applied Mathematics · doi:10.1137/0136016 · Cited by 1,359
Even, S. (1979) · Cited by 1,280
Blum, M., Floyd, R. W., Pratt, V., Rivest, R. L., & Tarjan, R. E. (1973) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(73)80033-9 · Cited by 1,235
Menger, K. (1927) · Fundamenta Mathematicae · doi:10.4064/fm-10-1-96-115 · Cited by 1,216
Numerical mathematics and computing
Cheney, W., & Kincaid, D. R. (1980) · Medical Entomology and Zoology · Cited by 1,165
Fredkin, E. (1960) · Communications of the ACM · doi:10.1145/367390.367400 · Cited by 1,090
Hopcroft, J., & Tarjan, R. (1974) · Journal of the ACM · doi:10.1145/321850.321852 · Cited by 1,081
Shamos, M. I., & Hoey, D. (1975) · 16th Annual Symposium on Foundations of Computer Science (sfcs 1975) · doi:10.1109/sfcs.1975.8 · Cited by 1,057
Brigham, E. O., & Yuen, C. K. (1978) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1978.4309919 · Cited by 1,038
Sur le problème des courbes gauches en Topologie
Kuratowski, C. (1930) · Fundamenta Mathematicae · doi:10.4064/fm-15-1-271-283 · Cited by 1,025
Algorithms for Reporting and Counting Geometric Intersections
Bentley, & Ottmann (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675432 · Cited by 996
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
Derivatives of Regular Expressions
Brzozowski, J. A. (1964) · Journal of the ACM · doi:10.1145/321239.321249 · Cited by 923
A linear-time algorithm for testing the truth of certain quantified boolean formulas
Aspvall, B., Plass, M. F., & Tarjan, R. E. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90002-4 · Cited by 892
Matroids and the greedy algorithm
Edmonds, J. (1971) · Mathematical Programming · doi:10.1007/bf01584082 · Cited by 866
Probabilistic algorithm for testing primality
Rabin, M. O. (1980) · Journal of Number Theory · doi:10.1016/0022-314x(80)90084-0 · Cited by 863
An analysis of several heuristics for the traveling salesman problem
Rosenkrantz, D. J., Stearns, R. E., & Lewis, P. M. (2009) · Fundamental Problems in Computing · doi:10.1007/978-1-4020-9688-4_3 · Cited by 772
Optimal Search in Planar Subdivisions
Kirkpatrick, D. (1983) · SIAM Journal on Computing · doi:10.1137/0212002 · Cited by 739
The Transitive Reduction of a Directed Graph
Aho, A. V., Garey, M. R., & Ullman, J. D. (1972) · SIAM Journal on Computing · doi:10.1137/0201008 · Cited by 718
Riemann's hypothesis and tests for primality
Miller, G. L. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80043-8 · Cited by 709
Practical Methods of Optimization. Volume 1: Unconstrained Optimization
Williams, T. (1980) · Cited by 697
A fast algorithm for computing longest common subsequences
Hunt, J. W., & Szymanski, T. G. (1977) · Communications of the ACM · doi:10.1145/359581.359603 · Cited by 691
Gilbert, E. N., & Pollak, H. O. (1968) · SIAM Journal on Applied Mathematics · doi:10.1137/0116001 · Cited by 690
Biggs, N. L., Lloyd, E. K., & Wilson, R. J. (1976) · Medical Entomology and Zoology · Cited by 676
Birkhoff, G., & Mac Lane, S. (2017) · A K Peters/CRC Press eBooks · doi:10.1201/9781315275499 · Cited by 671
On the identification of the convex hull of a finite set of points in the plane
Jarvis, R. A. (1973) · Information Processing Letters · doi:10.1016/0020-0190(73)90020-3 · Cited by 652
Klema, V., Dongarra, J. J., Bunch, J. R., Moler, C. B., & Stewart, G. W. (1980) · Mathematics of Computation · doi:10.2307/2006212 · Cited by 646
Applications of a Planar Separator Theorem
Lipton, R. J., & Tarjan, R. E. (1980) · SIAM Journal on Computing · doi:10.1137/0209046 · Cited by 640
The Complexity of Some Problems on Subsequences and Supersequences
Maier, D. (1978) · Journal of the ACM · doi:10.1145/322063.322075 · Cited by 616
Practical fast searching in strings
Horspool, R. N. (1980) · Software: Practice and Experience · doi:10.1002/spe.4380100608 · Cited by 594
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
The Complexity of Computing Steiner Minimal Trees
Garey, M. R., Graham, R. L., & Johnson, D. S. (1977) · SIAM Journal on Applied Mathematics · doi:10.1137/0132072 · Cited by 576
Arithmetic Complexity of Computations
Winograd, S. (1980) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970364 · Cited by 535
Williams, J. W. J. (1964) · Communications of the ACM · doi:10.1145/512274.3734138 · Cited by 527
Reingold, E. M., & Tilford, J. S. (1981) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1981.234519 · Cited by 505
Balas, E., & Padberg, M. W. (1976) · SIAM Review · doi:10.1137/1018115 · Cited by 449
Linear Programming, Methods and Applications
Smith, E. C., & Gass, S. I. (1965) · Mathematics of Computation · doi:10.2307/2003382 · Cited by 429
The NP-Completeness of the bandwidth minimization problem
Papadimitriou, C. H. (1976) · Computing · doi:10.1007/bf02280884 · Cited by 407
Finding a Minimum Circuit in a Graph
Itai, A., & Rodeh, M. (1978) · SIAM Journal on Computing · doi:10.1137/0207033 · Cited by 391
Combinatorial Algorithms: For Computers and Calculators
Nijenhuis, A., & Will, H. S. (2014) · Cited by 349
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Gabow, H. N. (1976) · Journal of the ACM · doi:10.1145/321941.321942 · Cited by 342
Regular Expression Search Algorithm
Thompson, I. E. (1970) · Cited by 340
Every Prime Has a Succinct Certificate
Pratt, V. R. (1975) · SIAM Journal on Computing · doi:10.1137/0204018 · Cited by 309
Triangulating a simple polygon
Garey, M. R., Johnson, D. S., Preparata, F. P., & Tarjan, R. E. (1978) · Information Processing Letters · doi:10.1016/0020-0190(78)90062-5 · Cited by 296
Expected time bounds for selection
Floyd, R. W., & Rivest, R. L. (1975) · Communications of the ACM · doi:10.1145/360680.360691 · Cited by 279
Approximate Traveling Salesman Algorithms
Golden, B., Bodin, L. D., Doyle, T., et al. (1980) · Operations Research · doi:10.1287/opre.28.3.694 · Cited by 277
Efficient computation of continuous skeletons
Kirkpatrick, D. G. (1979) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1979.15 · Cited by 262
Multidimensional Searching Problems
Dobkin, D., & Lipton, R. J. (1976) · SIAM Journal on Computing · doi:10.1137/0205015 · Cited by 248
Floyd, R. W. (1964) · Communications of the ACM · doi:10.1145/355588.365103 · Cited by 242
Matula, D. W., Marble, G., & Isaacson, J. D. (1972) · Graph Theory and Computing · doi:10.1016/b978-1-4832-3187-7.50015-5 · Cited by 232
Efficient algorithms for graph manipulation
Hopcroft, J. E., & Tarjan, R. E. (1971) · Cited by 231
A Minimum Distance Error-Correcting Parser for Context-Free Languages
Aho, A. V., & Peterson, T. G. (1972) · SIAM Journal on Computing · doi:10.1137/0201022 · Cited by 230
Linear time algorithm for isomorphism of planar graphs.
Hopcroft, J. E., & Wong, J. K. (1974) · Cited by 224
Lee, D. T., & Wong, C. K. (1977) · Acta Informatica · doi:10.1007/bf00263763 · Cited by 220
Boolean matrix multiplication and transitive closure
Fischer, M. J., & Meyer, A. R. (1971) · Annual Symposium on Switching & Automata Theory · doi:10.1109/swat.1971.4 · Cited by 203
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
Denardo, E. V., & Fox, B. L. (1979) · Operations Research · doi:10.1287/opre.27.1.161 · Cited by 198
A Lower Bound to Finding Convex Hulls
Yao, A. C.-C. (1981) · Journal of the ACM · doi:10.1145/322276.322289 · Cited by 157
A New Algorithm for Inner Product
Winograd, S. (1968) · IEEE Transactions on Computers · doi:10.1109/tc.1968.227420 · Cited by 148
Linear programming is log-space hard for P
Dobkin, D., Lipton, R. J., & Reiss, S. P. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90152-2 · Cited by 130
On the implementation of Strassen's fast multiplication algorithm
Cohen, J., & Roth, M. S. (1976) · Acta Informatica · doi:10.1007/bf00268135 · Cited by 33
Computational experiences with some transitive closure algorithms
Sysło, M. M., & Dzikiewicz, J. (1975) · Computing · doi:10.1007/bf02252834 · Cited by 11
Cited by
Invitation to Fixed-Parameter Algorithms
Niedermeier, R. (2006) · doi:10.1093/acprof:oso/9780198566076.001.0001 · Cited by 1,668
Automated De Novo Identification of Repeat Sequence Families in Sequenced Genomes
Bao, Z., & Eddy, S. R. (2002) · Genome Research · doi:10.1101/gr.88502 · Cited by 983
On Graph Kernels: Hardness Results and Efficient Alternatives
Gärtner, T., Flach, P., & Wrobel, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_11 · Cited by 879
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
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
- 110
- 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
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.