£100.93

Chapman and Hall/CRC Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)

Price data updated today

View at Amazon

Price History & Forecast

Last 91 days • 91 data points

Historical
Generating forecast...
£206.82 £90.34 £115.75 £141.17 £166.58 £192.00 £217.41 10 February 2026 04 March 2026 27 March 2026 18 April 2026 11 May 2026

Price Distribution

Price distribution over 91 days • 5 price levels

Days at Price
Current Price
5 days · current 1 day 59 days 13 days 13 days 0 15 30 44 59 £101 £181 £184 £202 £207 Days at Price

Price Analysis

Most common price: £184 (59 days, 64.8%)

Price range: £101 - £207

Price levels: 5 different prices over 91 days

Description

Explores the Impact of the Analysis of Algorithms on Many Areas within and beyond Computer Science A flexible, interactive teaching format enhanced by a large selection of examples and exercises Developed from the author’s own graduate-level course, Methods in Algorithmic Analysis presents numerous theories, techniques, and methods used for analyzing algorithms. It exposes students to mathematical techniques and methods that are practical and relevant to theoretical aspects of computer science. After introducing basic mathematical and combinatorial methods, the text focuses on various aspects of probability, including finite sets, random variables, distributions, Bayes’ theorem, and Chebyshev inequality. It explores the role of recurrences in computer science, numerical analysis, engineering, and discrete mathematics applications. The author then describes the powerful tool of generating functions, which is demonstrated in enumeration problems, such as probabilistic algorithms, compositions and partitions of integers, and shuffling. He also discusses the symbolic method, the principle of inclusion and exclusion, and its applications. The book goes on to show how strings can be manipulated and counted, how the finite state machine and Markov chains can help solve probabilistic and combinatorial problems, how to derive asymptotic results, and how convergence and singularities play leading roles in deducing asymptotic information from generating functions. The final chapter presents the definitions and properties of the mathematical infrastructure needed to accommodate generating functions. Accompanied by more than 1,000 examples and exercises, this comprehensive, classroom-tested text develops students’ understanding of the mathematical methodology behind the analysis of algorithms. It emphasizes the important relation between continuous (classical) mathematics and discrete mathematics, which is the basis of computer science.

Key Features

New

Mint Condition

Dispatch same day for order received before 12 noon

Guaranteed packaging

No quibbles returns

Product Specifications

Format
hardcover
Domain
Amazon UK
Release Date
03 November 2009
Listed Since
10 July 2007

Barcode

No barcode data available