ebooks and download videos Search All  Title  Author 
Home / Nonfiction / Computers / Programming / Algorithms

Methods in Algorithmic Analysis

| £91.61 | €103.03 | Ca$148.63 | Au$146.68
by Vladimir A. Dobrushkin
What is this?DRM-PDF | by download   add to wish list
Methods in Algorithmic Analysis by Vladimir A. Dobrushkin

Explores the Impact of the Analysis of Algorithms on Many Areas within and beyond Computer ScienceA 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.

To view this DRM protected ebook on your desktop or laptop you will need to have Adobe Digital Editions installed. It is a free software. We also strongly recommend that you sign up for an AdobeID at the Adobe website. For more details please see FAQ 1&2. To view this ebook on an iPhone, iPad or Android mobile device you will need the Adobe Digital Editions app, or BlueFire Reader or Txtr app. These are free, too. For more details see this article.

SHARE  Share by Email  Share on Facebook  Share on Twitter  Share on Linked In  Share on Delicious
or call in the US toll free 1-888-866-9150 product ID: 726347

Ebook Details
Pages: 824
Size: 5.9 MB
Publisher: CRC Press
Date published:   2009
ISBN: 9781420068306 (DRM-PDF)

DRM Settings
Copying:not allowed
Printing:not allowed
Read Aloud:  not allowed

Territory Restrictions
This ebook will NOT be sold to customers with a billing address in:

This product is listed in the following categories:

Nonfiction > Mathematics
Nonfiction > Computers > Computer Engineering
Nonfiction > Computers > Programming > Algorithms

This author has products in the following categories:

Nonfiction > Mathematics
Nonfiction > Computers > Computer Engineering
Nonfiction > Computers > Programming > Algorithms
Nonfiction > Mathematics > Applied
Nonfiction > Mathematics > Differential Equations

If you find anything wrong with this product listing, perhaps the description is wrong, the author is incorrect, or it is listed in the wrong category, then please contact us. We will promptly address your feedback.

Submit 5 page SummaryWhat is this?

© 2016