skip to main content
Skip header Section
An introduction to the analysis of algorithmsJanuary 1996
Publisher:
  • Addison-Wesley Longman Publishing Co., Inc.
  • 75 Arlington Street, Suite 300 Boston, MA
  • United States
ISBN:978-0-201-40009-0
Published:01 January 1996
Pages:
492
Skip Bibliometrics Section
Bibliometrics
Abstract

No abstract available.

Cited By

  1. Pei T and Takahashi S (2023). Nash equilibria in random games with right fat-tailed distributions, International Journal of Game Theory, 52:4, (1153-1177), Online publication date: 1-Dec-2023.
  2. Fernández M, Livieratos J and Martín S (2023). Bounds and Constructions of Parent Identifying Schemes via the Algorithmic Version of the Lovász Local Lemma, IEEE Transactions on Information Theory, 69:11, (7049-7069), Online publication date: 1-Nov-2023.
  3. Brodal G, Rysgaard C, Schou J and Svenning R Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location Algorithms and Data Structures, (644-659)
  4. ACM
    Langdon W (2022). Deep Genetic Programming Trees Are Robust, ACM Transactions on Evolutionary Learning and Optimization, 2:2, (1-34), Online publication date: 30-Jun-2022.
  5. Langdon W (2022). Genetic programming convergence, Genetic Programming and Evolvable Machines, 23:1, (71-104), Online publication date: 1-Mar-2022.
  6. ACM
    Langdon W Parallel GPQUICK Proceedings of the Genetic and Evolutionary Computation Conference Companion, (63-64)
  7. Kulikov A and Podolskii V (2019). Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates, Theory of Computing Systems, 63:5, (956-986), Online publication date: 1-Jul-2019.
  8. Aguinaga S, Chiang D and Weninger T (2019). Learning Hyperedge Replacement Grammars for Graph Generation, IEEE Transactions on Pattern Analysis and Machine Intelligence, 41:3, (625-638), Online publication date: 1-Mar-2019.
  9. ACM
    Zhao G, Xiong X and Wu H A Model for Analyzing the Effectiveness of Moving Target Defense Proceedings of the 8th International Conference on Communication and Network Security, (17-21)
  10. Jacopin E Statistical Planning: Building Models of Entropy of Centralized Planning for Multi-Agent Systems 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), (100-109)
  11. Magner A, Turowski K and Szpankowski W (2018). Lossless Compression of Binary Trees With Correlated Vertex Names, IEEE Transactions on Information Theory, 64:9, (6070-6080), Online publication date: 1-Sep-2018.
  12. Kirousis L and Livieratos J A Simple Algorithmic Proof of the Symmetric Lopsided Lovász Local Lemma Learning and Intelligent Optimization, (49-63)
  13. ACM
    Mpanti A, Nikolopoulos S and Rini M Experimental Study of the Resilience of a Graph-based Watermarking System under Edge Modifications Proceedings of the 21st Pan-Hellenic Conference on Informatics, (1-6)
  14. ACM
    Mpanti A and Nikolopoulos S Graph-structured Watermarking using Bitonic Sequences of Self-inverting Permutations Proceedings of the 20th Pan-Hellenic Conference on Informatics, (1-6)
  15. ACM
    Li Y and Woodruff D On approximating functions of the singular values in a stream Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, (726-739)
  16. Clément J, Fill J, Nguyen Thi T and Vallée B (2016). Towards a Realistic Analysis of the QuickSelect Algorithm, Theory of Computing Systems, 58:4, (528-578), Online publication date: 1-May-2016.
  17. Bereczky N, Duch A, Németh K and Roura S (2016). Quad-kd trees, Theoretical Computer Science, 616:C, (126-140), Online publication date: 22-Feb-2016.
  18. ACM
    Aumüller M and Dietzfelbinger M (2015). Optimal Partitioning for Dual-Pivot Quicksort, ACM Transactions on Algorithms, 12:2, (1-36), Online publication date: 12-Feb-2016.
  19. ACM
    Chroni M and Nikolopoulos S Encoding numbers into reducible permutation graphs using heap-ordered trees Proceedings of the 19th Panhellenic Conference on Informatics, (311-316)
  20. D'Angelo G, Diodati D, Navarra A and Pinotti C (2015). The minimum k-storage problem on directed graphs, Theoretical Computer Science, 596:C, (102-108), Online publication date: 6-Sep-2015.
  21. Campagni R, Merlini D, Sprugnoli R and Verri M (2015). Data mining models for student careers, Expert Systems with Applications: An International Journal, 42:13, (5508-5521), Online publication date: 1-Aug-2015.
  22. Codish M, Cruz-Filipe L, Nebel M and Schneider-Kamp P Applying Sorting Networks to Synthesize Optimized Sorting Libraries Revised Selected Papers of the 25th International Symposium on Logic-Based Program Synthesis and Transformation - Volume 9527, (127-142)
  23. Fuchs M (2015). A note on the quicksort asymptotics, Random Structures & Algorithms, 46:4, (677-687), Online publication date: 1-Jul-2015.
  24. ACM
    Wild S, Nebel M and Neininger R (2015). Average Case and Distributional Analysis of Dual-Pivot Quicksort, ACM Transactions on Algorithms, 11:3, (1-42), Online publication date: 13-Jan-2015.
  25. Kocamaz U (2013). Increasing the efficiency of quicksort using a neural network based algorithm selection model, Information Sciences: an International Journal, 229, (94-105), Online publication date: 1-Apr-2013.
  26. Kyriakoussis A and Vamvakari M (2013). A q-Analogue of the Stirling Formula and a Continuous Limiting Behaviour of the q-Binomial Distribution—Numerical Calculations, Methodology and Computing in Applied Probability, 15:1, (187-213), Online publication date: 1-Mar-2013.
  27. Deutsch E (2012). Rooted tree statistics from Matula numbers, Discrete Applied Mathematics, 160:15, (2314-2322), Online publication date: 1-Oct-2012.
  28. ACM
    Bassino F, Clément J and Nicodème P (2012). Counting occurrences for a finite set of words, ACM Transactions on Algorithms, 8:3, (1-28), Online publication date: 1-Jul-2012.
  29. David J (2012). Average complexity of Moore's and Hopcroft's algorithms, Theoretical Computer Science, 417, (50-65), Online publication date: 1-Feb-2012.
  30. Bilotta S, Merlini D, Pergola E and Pinzani R (2012). Pattern 1 j+10 j Avoiding Binary Words, Fundamenta Informaticae, 117:1-4, (35-55), Online publication date: 1-Jan-2012.
  31. Nebel M and Anika S (2011). Analysis of the Free Energy in a Stochastic RNA Secondary Structure Model, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8:6, (1468-1482), Online publication date: 1-Nov-2011.
  32. Ng W Developing RFID database models for analysing moving tags in supply chain management Proceedings of the 30th international conference on Conceptual modeling, (204-218)
  33. Martínez C, Panholzer A and Prodinger H (2011). The analysis of Range Quickselect and related problems, Theoretical Computer Science, 412:46, (6537-6555), Online publication date: 1-Oct-2011.
  34. Drmota M and Szpankowski W A master theorem for discrete divide and conquer recurrences Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms, (342-361)
  35. Došlić T and Måløy F (2010). Chain hexagonal cacti, Discrete Mathematics, 310:12, (1676-1690), Online publication date: 1-Jun-2010.
  36. Szpankowski W Average case analysis of algorithms Algorithms and theory of computation handbook, (11-11)
  37. Seidel R Data-specific analysis of string sorting Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (1278-1286)
  38. Costermans C and Hoang Ngoc Minh (2009). Noncommutative algebra, multiple harmonic sums and applications in discrete probability, Journal of Symbolic Computation, 44:7, (801-817), Online publication date: 1-Jul-2009.
  39. Martínez C and Prodinger H (2009). Moves and displacements of particular elements in Quicksort, Theoretical Computer Science, 410:21-23, (2279-2284), Online publication date: 1-May-2009.
  40. Mahmoud H Average-case analysis of moves in quick select Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, (35-40)
  41. Atajan T, Otsuka N and Yong X The spanning trees formulas in a class of double fixed-step loop networks Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, (17-22)
  42. Boldi P, Lonati V, Radicioni R and Santini M (2008). The number of convex permutominoes, Information and Computation, 206:9-10, (1074-1083), Online publication date: 1-Sep-2008.
  43. Baccherini D and Merlini D (2008). Combinatorial analysis of Tetris-like games, Discrete Mathematics, 308:18, (4165-4176), Online publication date: 1-Sep-2008.
  44. Guo X, Boubekeur M, Mc Enery J and Hickey D A new approach for ACET based scheduling of soft real-time systems Proceedings of the 12th WSEAS international conference on Computers, (886-892)
  45. Röck A Stream ciphers using a random update function Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology, (258-275)
  46. Fernández-Camacho M and Sánchez-Couso J (2007). Binary Search Trees, Recurrent Properties andWave Equations, Fundamenta Informaticae, 81:4, (409-439), Online publication date: 1-Jun-2008.
  47. Fernández-Camacho M and Sánchez-Couso J (2007). Binary Search Trees, Recurrent Properties andWave Equations, Fundamenta Informaticae, 81:4, (409-439), Online publication date: 1-Dec-2007.
  48. ACM
    Aspnes J and Shah G (2007). Skip graphs, ACM Transactions on Algorithms, 3:4, (37-es), Online publication date: 1-Nov-2007.
  49. Okasha H and Rösler U (2007). Asymptotic distributions for Random Median Quicksort, Journal of Discrete Algorithms, 5:3, (592-608), Online publication date: 1-Sep-2007.
  50. Baccherini D, Merlini D and Sprugnoli R Tablatures for stringed instruments and generating functions Proceedings of the 4th international conference on Fun with algorithms, (40-52)
  51. ACM
    Navarro G and Mäkinen V (2007). Compressed full-text indexes, ACM Computing Surveys, 39:1, (2-es), Online publication date: 12-Apr-2007.
  52. Keijzer M and Foster J Crossover bias in genetic programming Proceedings of the 10th European conference on Genetic programming, (33-44)
  53. Kitaev S (2007). Introduction to partially ordered patterns, Discrete Applied Mathematics, 155:8, (929-944), Online publication date: 1-Apr-2007.
  54. Kuba M and Panholzer A (2007). The left-right-imbalance of binary search trees, Theoretical Computer Science, 370:1-3, (265-278), Online publication date: 1-Feb-2007.
  55. Flajolet P Analytic combinatorics Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (137-148)
  56. Archibald M, Knopfmacher A and Prodinger H (2006). The number of distinct values in a geometrically distributed sample, European Journal of Combinatorics, 27:7, (1059-1081), Online publication date: 1-Oct-2006.
  57. Goldwurm M and Lonati V (2006). Pattern statistics and Vandermonde matrices, Theoretical Computer Science, 356:1, (153-169), Online publication date: 5-May-2006.
  58. Sánchez-Couso J and Fernández-Camacho M (2006). Reductions in binary search trees, Theoretical Computer Science, 355:3, (327-353), Online publication date: 14-Apr-2006.
  59. Flajolet P, Nebel M and Prodinger H (2006). The scientific works of Rainer Kemp (1949-2004), Theoretical Computer Science, 355:3, (371-381), Online publication date: 14-Apr-2006.
  60. Asveld P (2006). Generating all permutations by context-free grammars in Chomsky normal form, Theoretical Computer Science, 354:1, (118-130), Online publication date: 21-Mar-2006.
  61. Bourdon J and Vallée B Pattern matching statistics on correlated sources Proceedings of the 7th Latin American conference on Theoretical Informatics, (224-237)
  62. Flajolet P The ubiquitous digital tree Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science, (1-22)
  63. Kobayashi K, Morita H and Hoshi M Percolation on a k-ary tree General Theory of Information Transfer and Combinatorics, (633-638)
  64. ACM
    Flajolet P, Szpankowski W and Vallée B (2006). Hidden word statistics, Journal of the ACM, 53:1, (147-183), Online publication date: 1-Jan-2006.
  65. Martínez C and Molinero X (2005). Efficient iteration in admissible combinatorial classes, Theoretical Computer Science, 346:2, (388-417), Online publication date: 28-Nov-2005.
  66. Baril J and Vajnovszki V (2005). Minimal change list for Lucas strings and some graph theoretic consequences, Theoretical Computer Science, 346:2, (189-199), Online publication date: 28-Nov-2005.
  67. ACM
    Viola A (2005). Exact distribution of individual displacements in linear probing hashing, ACM Transactions on Algorithms, 1:2, (214-242), Online publication date: 1-Oct-2005.
  68. Groenevelt R, Nain P and Koole G (2005). The message delay in mobile ad hoc networks, Performance Evaluation, 62:1-4, (210-228), Online publication date: 1-Oct-2005.
  69. Avanzi R, Heuberger C and Prodinger H Minimality of the hamming weight of the τ-NAF for Koblitz curves and improved combination with point halving Proceedings of the 12th international conference on Selected Areas in Cryptography, (332-344)
  70. Bradford P and Gavrylyako O (2005). Foundations of Security for Hash Chains in Ad Hoc Networks, Cluster Computing, 8:2-3, (189-195), Online publication date: 1-Jul-2005.
  71. Langdon W and Banzhaf W Repeated patterns in tree genetic programming Proceedings of the 8th European conference on Genetic Programming, (190-202)
  72. Karimou D and Myoupo J (2005). An Application of an Initialization Protocol to Permutation Routing in a Single-Hop Mobile Ad Hoc Networks, The Journal of Supercomputing, 31:3, (215-226), Online publication date: 1-Mar-2005.
  73. Fill J, Flajolet P and Kapur N (2005). Singularity analysis, Hadamard products, and tree recurrences, Journal of Computational and Applied Mathematics, 174:2, (271-313), Online publication date: 15-Feb-2005.
  74. Park G and Szpankowski W Towards a complete characterization of tries Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, (33-42)
  75. Pemantle R (2005). Cycles in random k-ary maps and the poor performance of random number generation, Journal of Algorithms, 54:1, (72-84), Online publication date: 1-Jan-2005.
  76. Flajolet P Counting by coin tossings Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday, (1-12)
  77. Panholzer A (2004). The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees, Random Structures & Algorithms, 25:2, (179-207), Online publication date: 1-Sep-2004.
  78. Panholzer A, Prodinger H and Riedel M (2004). Permuting in place, Journal of Algorithms, 51:2, (170-184), Online publication date: 1-May-2004.
  79. Gregor J Partial difference equation and the maximum principle Proceedings of the 5th WSEAS International Conference on Applied Mathematics, (1-6)
  80. Marckert J (2004). The rotation correspondence is asymptotically a dilatation, Random Structures & Algorithms, 24:2, (118-132), Online publication date: 1-Mar-2004.
  81. Ravelomanana V and Thimonier L (2004). Forbidden subgraphs in connected graphs, Theoretical Computer Science, 314:1, (121-171), Online publication date: 25-Feb-2004.
  82. Kim Y and Moon B (2004). Lock-Gain Based Graph Partitioning, Journal of Heuristics, 10:1, (37-57), Online publication date: 1-Jan-2004.
  83. Gwadera R, Atallah M and Szpankowski W Reliable Detection of Episodes in Event Sequences Proceedings of the Third IEEE International Conference on Data Mining
  84. Deutsch E and Prodinger H (2003). A bijection between directed column-convex polyominoes and ordered trees of height at most three, Theoretical Computer Science, 307:2, (319-325), Online publication date: 7-Oct-2003.
  85. Hohlweg C and Reutenauer C (2003). Lyndon words, permutations and trees, Theoretical Computer Science, 307:1, (173-178), Online publication date: 26-Sep-2003.
  86. Meyer U (2003). Average-case complexity of single-source shortest-paths algorithms, Journal of Algorithms, 48:1, (91-134), Online publication date: 1-Aug-2003.
  87. Métivier Y, Saheb N and Zemmari A (2003). Analysis of a randomized rendezvous algorithm, Information and Computation, 184:1, (109-128), Online publication date: 10-Jul-2003.
  88. Panholzer A (2003). Analysis of multiple quickselect variants, Theoretical Computer Science, 302:1-3, (45-91), Online publication date: 13-Jun-2003.
  89. Leung H, Chung F and Chan S A new sequential mining approach to XML document similarity computation Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining, (356-362)
  90. Louchard G and Turner J (2003). Generalized covariances of multi-dimensional Brownian excursion local times, Theoretical Computer Science, 297:1-3, (317-336), Online publication date: 17-Mar-2003.
  91. Elizalde S and Noy M (2003). Consecutive patterns in permutations, Advances in Applied Mathematics, 30:1-2, (110-125), Online publication date: 1-Feb-2003.
  92. Niedermeier R and Rossmanith P (2003). An efficient fixed-parameter algorithm for 3-hitting set, Journal of Discrete Algorithms, 1:1, (89-102), Online publication date: 1-Feb-2003.
  93. Durand M (2003). Asymptotic analysis of an optimized quicksort algorithm, Information Processing Letters, 85:2, (73-77), Online publication date: 31-Jan-2003.
  94. Szwarcfiter J, Navarro G, Baeza-Yates R, Oliveira J, Cunto W and Ziviani N (2003). Optimal binary search trees with costs depending on the access paths, Theoretical Computer Science, 290:3, (1799-1814), Online publication date: 3-Jan-2003.
  95. Grabmeier J, Kaltofen E and Weispfenning V Cited References Computer algebra handbook, (493-622)
  96. Van der Hoeven J (2002). Relax, but don't be too lazy, Journal of Symbolic Computation, 34:6, (479-542), Online publication date: 1-Dec-2002.
  97. Reznik Y (2002). Some results on tries with adaptive branching, Theoretical Computer Science, 289:2, (1009-1026), Online publication date: 30-Oct-2002.
  98. Penaud J and Roques O (2002). Tirage a pile ou face de mots de Fibonacci, Discrete Mathematics, 256:3, (791-800), Online publication date: 28-Oct-2002.
  99. Deutsch E and Shapiro L (2002). A bijection between ordered trees and 2-Motzkin paths and its many consequences, Discrete Mathematics, 256:3, (655-670), Online publication date: 28-Oct-2002.
  100. Deutsch E, Feretic S and Noy M (2002). Diagonally convex directed polyominoes and even trees, Discrete Mathematics, 256:3, (645-654), Online publication date: 28-Oct-2002.
  101. Grabner P and Prodinger H (2002). Sorting algorithms for broadcast communications, Theoretical Computer Science, 289:1, (51-67), Online publication date: 23-Oct-2002.
  102. Flajolet P, Hatzis K, Nikoletseas S and Spirakis P (2002). On the robustness of interconnections in random graphs, Theoretical Computer Science, 287:2, (515-534), Online publication date: 28-Sep-2002.
  103. Akhavi A (2002). Random lattices, threshold phenomena and efficient reduction algorithms, Theoretical Computer Science, 287:2, (359-385), Online publication date: 28-Sep-2002.
  104. Smythe R and Wellner J (2002). Asymptotic analysis of (3, 2, 1)-shell sort, Random Structures & Algorithms, 21:1, (59-75), Online publication date: 1-Aug-2002.
  105. Panholzer A and Prodinger H (2002). Binary search tree recursions with harmonic toll functions, Journal of Computational and Applied Mathematics, 142:1, (211-225), Online publication date: 1-May-2002.
  106. Cancela H and Urquhart M (2002). Adapting RVR Simulation Techniques for Residual Connectedness Network Reliability Models, IEEE Transactions on Computers, 51:4, (439-443), Online publication date: 1-Apr-2002.
  107. ACM
    Sanders I (2002). Teaching empirical analysis of algorithms, ACM SIGCSE Bulletin, 34:1, (321-325), Online publication date: 1-Mar-2002.
  108. ACM
    Sanders I Teaching empirical analysis of algorithms Proceedings of the 33rd SIGCSE technical symposium on Computer science education, (321-325)
  109. Keller J (2002). A heuristic to accelerate in-situ permutation algorithms, Information Processing Letters, 81:3, (119-125), Online publication date: 14-Feb-2002.
  110. Bar-Yehuda R, Halldórsson M, Naor J, Shachnai H and Shapira I Scheduling split intervals Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (732-741)
  111. Nanopoulos A, Theodoridis Y and Manolopoulos Y C2P Proceedings of the 27th International Conference on Very Large Data Bases, (331-340)
  112. O'connor L (2001). On String Replacement Exponentiation, Designs, Codes and Cryptography, 23:2, (173-184), Online publication date: 1-Jul-2001.
  113. ACM
    Ciriani V Logic minimization using exclusive OR gates Proceedings of the 38th annual Design Automation Conference, (115-120)
  114. ACM
    Roura S (2001). Improved master theorems for divide-and-conquer recurrences, Journal of the ACM, 48:2, (170-205), Online publication date: 1-Mar-2001.
  115. ACM
    Gil J (2001). Subtyping arithmetical types, ACM SIGPLAN Notices, 36:3, (276-289), Online publication date: 1-Mar-2001.
  116. Rösler U (2001). On the analysis of stochastic divide and conquer algorithms, Algorithmica, 29:1-2, (238-261), Online publication date: 1-Feb-2001.
  117. Martínez C, Panholzer A and Prodinger H (2001). Partial match queries in relaxed multidimensional search trees, Algorithmica, 29:1-2, (181-204), Online publication date: 1-Feb-2001.
  118. Chern H and Hwang H (2001). Transitional behaviors of the average cost of quicksort with median-of-(2t + 1), Algorithmica, 29:1-2, (44-69), Online publication date: 1-Feb-2001.
  119. ACM
    Gil J Subtyping arithmetical types Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (276-289)
  120. ACM
    Siltaneva J and Mäkinen E (2000). A note on the expected distribution of degrees in random binary trees, ACM SIGCSE Bulletin, 32:4, (32-33), Online publication date: 1-Dec-2000.
  121. Langdon W (2000). Size Fair and Homologous Tree Crossovers for Tree Genetic Programming, Genetic Programming and Evolvable Machines, 1:1-2, (95-119), Online publication date: 1-Apr-2000.
  122. ACM
    Shen Z The calculation of average distance in mesh structures Proceedings of the 2000 ACM symposium on Applied computing - Volume 1, (89-93)
  123. O'Connor L An analysis of exponentiation based on formal languages Proceedings of the 17th international conference on Theory and application of cryptographic techniques, (375-388)
  124. Puschner P (1999). Real-Time Performance of Sorting Algorithms, Real-Time Systems, 16:1, (63-79), Online publication date: 1-Jan-1999.
  125. ACM
    Ferri F and Albert J (1998). Average-case analysis in an elementary course on algorithms, ACM SIGCSE Bulletin, 30:1, (202-206), Online publication date: 1-Mar-1998.
  126. ACM
    Ferri F and Albert J Average-case analysis in an elementary course on algorithms Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education, (202-206)
  127. Clément J, Flajolet P and Vallée B The analysis of hybrid trie structures Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (531-539)
  128. Kushilevitz E and Mansour Y Computation in noisy radio networks Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (236-243)
  129. ACM
    van der Hoeven J Lazy multiplication of formal power series Proceedings of the 1997 international symposium on Symbolic and algebraic computation, (17-20)
Contributors
  • Princeton University
  • INRIA Rocquencourt

Recommendations

Reviews

John B. Slater

Some books take longer to review than others. When two eminent practitioners with a lot of experience in writing for various audiences produce a book of this length on the analysis of algorithms, it is unlikely that the critical reader is going to appreciate everything in one read. Even after a couple of months of delving, one continues to find new material, especially in the plentiful exercises, which are packed with examples that can be used in a course in this area. Anyone conducting such a course should have this book on the shelf. The authors claim that the work has a variety of uses—as a textbook in a third- or fourth-year course on mathematical analysis of algorithms, in a discrete math course for computer science students, and as backup to a course introducing mathematicians to data structures and algorithms. It might also be used as the basis of an introductory graduate course or as a reference work for researchers. There is no doubt whatsoever about the book's considerable advantages for these purposes, though. The book is divided into eight chapters, of which chapters 2 through 4 give the underlying mathematical theory with practical examples. Chapters 5 through 8 concentrate more on applications in actual algorithms and combinatorial structures and have more of a computer science feel. Chapter 1 is relatively short; it endeavors to illustrate the interplay between the two approaches and to set the book in context. It does this through a combination of high-level discussion and concrete examples likely to be familiar in some form to all possible readers, such as Quicksort. It effectively demonstrates the techniques and thinking behind the book, but many undergraduates may be unable to appreciate it immediately. In this chapter, the dense presentation is most intrusive. Later in the book, there is much more white space, with tables and formulas spread out, but here the words close in on the reader. The remainder of the book is excellently laid out and accurate. Each chapter has its own set of references, which are helpful and extensive and overlap appropriately. Each chapter also contains a summary, which gives an overview of the material and places the chapter in context. Other meta-discussion helps readers find their way through the book. The notation is clear, standard, and built up nicely as needed. A helpful list of themes and an extensive index are also provided. The exercises provided (without solutions) are, however, the best feature of the work. Their choice and positioning show the considerable care taken, and their use will repay any reader. The second chapter is the easiest for a third-year student to follow. The relationship with interactive and recursive techniques is brought out, as is the general way to approach a difference equation; the authors clearly differentiate between exact and precise methods. The third chapter introduces generating functions initially as formal entities, and this algebraic approach pervades. This chapter contains a number of excellent reference tables. The notation and analysis are clear. The fourth chapter, completing the mathematical part, is on asymptotics, and it will be much harder for students to follow without substantial help. The important Ramanujan distributions are covered alongside the more traditional normal and Poisson distributions. A wealth of examples help readers understand the inevitably hard math problems of bounding tails and approximating sums with integrals. In the computer science chapters, the authors visit trees and their enumeration and applications (in chapter 5), permutations and enumeration problems (in chapter 6), strings and tries (in chapter 7), and words and maps (in chapter 8). They give clear leads into much current research, and examples that start out with simple applications of the earlier material are rapidly shown to link with the state of the art. This is only possible with the wealth of knowledge that comes from being at the forefront of research in this area. This book is for teachers, researchers, or graduate students. It is a book from which to get examples and to have available to support many types of courses. Its suitability as a course book for undergraduates is less clear.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.