Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)
Language: English
Published by Chapman and Hall/CRC 2017-06-16, 2017
- Softcover
- New

Seller: Chiron Media, Wallingford, United KingdomChiron Media
AbeBooks seller since August 2, 2010
Condition: New
US$ 109.86
Quantity: 5 available
Add to basketItem description from seller
Brand new book, sourced directly from publisher. Dispatch time is 7-8 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.
Seller Inventory # 6666-TNFPD-9781138118041
- Title
- Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)
- Author
- Vladimir A. Dobrushkin
- Publisher
- Chapman and Hall/CRC 2017-06-16
- Publication year
- 2017
- Condition
- New
- Binding
- Paperback
- Language
- English
- ISBN 10
- 1138118044
- ISBN 13
- 9781138118041
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.
"Synopsis" may belong to another edition of this title.
About the Author
Vladimir A. Dobrushkin is a professor in the Division of Applied Mathematics at Brown University and a professor in the Department of Computer Science at Worcester Polytechnic Institute.
"About the title" may belong to another edition of this title.
Chiron Media
Wallingford, United Kingdom
AbeBooks seller since August 2, 2010
Shipping rates from United Kingdom to U.S.A.
| Item | 24 to 38 business days | 24 to 38 business days |
|---|---|---|
| First item | US$ 13.20 | US$ 13.20 |
Payment methods
Seller's business information
WRAP Ltd
Unit 4, 119 Loverock Rd
Reading, United Kingdom RG30 1DZ
Terms of sale
TBA
Shipping terms
Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.