Methods in Algorithmic Analysis

Vladimir A. Dobrushkin

ISBN 10: 1420068296 / ISBN 13: 9781420068290

Published by Chapman And Hall/CRC, 2009

About this Item

nach der Bestellung gedruckt Neuware - Printed after ordering - Focusing on the analysis of algorithms, this book presents a comprehensive treatment of the mathematics used to analyze computer algorithms. It provides information on the theory of the topic by including many algorithms and code fragments with detailed analysis. Unlike similar books, this one contains material on enumeration with generating functions, shuffle products, combinatorics of strings, counting in regular languages, and asymptotics from recurrences. The text incorporates the use of C++ throughout and includes many examples and exercises of varying levels of difficulty. A solutions manual is available for qualifying instructors.

Seller Inventory # 9781420068290

Bibliographic Details

• Title: Methods in Algorithmic Analysis
• Publisher: Chapman And Hall/CRC
• Publication Date: 2009
• Language: English
• ISBN 10: 1420068296
• ISBN 13: 9781420068290
• Binding: Buch
• Condition: Neu
• Dimensions: 260W x 183H x 48D millimeters 260 millimeters width by 183 millimeters height by 48 millimeters depth
• Weight: 1718 grams

About this title

Synopsis

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.

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.